Filters








7 Hits in 9.2 sec

QIH: an Efficient Q-learning Inspired Hole-Bypassing Routing Protocol for WSNs

Phi Le Nguyen, Nang Hung Nguyen, Tuan Anh Nguyen Dinh, Khanh Le, Thanh Hung Nguyen, Kien Nguyen
2021 IEEE Access  
These issues may degrade the network lifetime of WSNs since they cause a long detour path and a traffic concentration around the hole boundary.  ...  This paper addresses the local minimum phenomenon, routing path enlargement, and load imbalance problems of geographic routing in wireless sensor networks (WSNs) with holes.  ...  In [18], they 974 described the hole by a polygon whose vertices are all the 975 nodes staying on the hole boundary.  ... 
doi:10.1109/access.2021.3108156 fatcat:jxkeix2pxzhapi33q2jjsr4srm

A Survey on Holes Problem in Wireless Underground Sensor Networks

Priyanka Sharma, Rishi Pal Singh, Mazin Abed Mohammed, Rachna Shah, Jan Nedoma
2021 IEEE Access  
An efficient hole detection technique shall increase network lifetime, use lesser resources and give accurate results with zero false positive.  ...  There can be a different kind of holes in the network such as coverage hole, routing hole, jamming hole, and sink/ worm hole, etc.  ...  pipeline Pk having even value of k, left hand rule is followed on hole boundary for hole detouring.. c) If multiple channels are there at boundary of hole, packet for detecting hole boundary is sent in  ... 
doi:10.1109/access.2021.3140038 fatcat:6ojeal7tbjhadgxw3p7ta7xvbm

GOAL: A parsimonious geographic routing protocol for large scale sensor networks

Myounggyu Won, Wei Zhang, Radu Stoleru
2013 Ad hoc networks  
To compactly describe holes, we develop a novel distributed convex hull algorithm, which improves the message complexity O(n log 2 n) of state of art distributed convex hull algorithm to O(n log n).  ...  The constant path stretch, however, is achieved at the cost of communication and storage overhead, which makes the practical deployment of VIGOR in large scale sensor networks challenging.  ...  We adopt the boundary node detection scheme used in VIGOR [8] for implementing the first phase of this process.  ... 
doi:10.1016/j.adhoc.2012.07.006 fatcat:x2a77fybrjcvrhuvhnhpbxmona

Geographic routing with constant stretch in large scale sensor networks with holes

Myounggyu Won, Radu Stoleru, Haijie Wu
2011 2011 IEEE 7th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)  
We develop a novel distributed convex hull construction (DCC) algorithm that compactly describes holes.  ...  This compact representation of a hole is leveraged by nodes to make locally optimal routing decisions. Our theoretical analysis proves the constant stretch property and average stretch of GOAL.  ...  Thus, the decision to make a detour around a hole is more likely to be delayed, resulting in higher average hop stretch.  ... 
doi:10.1109/wimob.2011.6085349 dblp:conf/wimob/WonSW11 fatcat:b7qenzxwjzepjeuy63y3rl2bru

IMPROVING QUALITY OF SERVICE IN WIRELESS SENSOR NETWORKS USING NEIGHBOR CONSTRAINT TRANSMISSION CENTRIC DISTRIBUTED SINK HOLE DETECTION AND NETWORK SIMULATOR 2

K Karthigadevi, S Balamurali, M Venkatesulu
2017 unpublished
The method produces efficient results in sinkhole detection and increases the throughput. Also the method reduces the packet drop ratio and reduces the frequency of sinkhole detection.  ...  With the advances in technology, there has been an increasing interest in the use of wireless sensor networks (WSNs).  ...  Virtual convex polygon based hole boundary detection and time delay based hole detour scheme in WSNs. In Symposium on Human Interface. pp. 619-627.  ... 
fatcat:nfuv2py5dfde5oiblps6yiobcq

Wireless sensor and event localization

Anindya Iqbal
2017
To avail these opportunities, a computationally-efficient arc-coding based technique is developed to accurately calculate the boundaries of all non-overlapping sectors of a system of overlapping disks  ...  Different signal processing and estimation techniques are available that vary in terms of localization accuracy and resource efficiency.  ...  By passing holes, a shortest path was segmented according to the intermediate boundary nodes. It further created "virtual holes" to augment and render the shortest path.  ... 
doi:10.4225/03/58a65c53b437f fatcat:mgwcsz6bizag3pq52y7ityneuy

Routing and Data Dissemination [chapter]

Sajal K. Das, Habib M. Ammari
Wireless Sensor Networks  
In WSNs, the delay in the transmission of sensed data depends on the transmission time because there is no queuing delay and the propagation and processing delays are negligible compared to the transmission  ...  On the other hand, mobility is a desirable feature that can be used to tackle some problems in WSNs, for example, coverage hole and connectivity hole.  ...  In this case, the information query routing is based on localized decisions by individual sensors that consider the regions in the sensor fi eld, where the constraints imposed by the composite objective  ... 
doi:10.1002/9780470443521.ch4 fatcat:5h7qvw2lmrd55n7xjg35ktdzka