Coverage Hole Detection and Recovery in Wireless Sensor Networks Based on RSSI-Based Localization

2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)(2017)

Cited 11|Views34
No score
Abstract
Wireless Sensor Networks (WSNs) based on RSSI-based localization techniques have been widely used in various applications, such as intrusion detection, battlefield surveillance, and animal monitoring. One fundamental performance measure in those applications is the sensing coverage of the target field. Most existing works on coverage assume that the sensing area of a sensor node is a disc. However, this disc model is too simplistic for many information processing systems, and there are sensing techniques whose sensing areas are non-disc. In this paper, we focus on coverage performance of WSNs based on RSSI-based localization techniques whose sensing area is an ellipse. We propose an algorithm inspired by Voronoi diagram and Delaunay triangulation to detect and recover coverage holes. Simulation results show that our algorithm can recover all holes, and can reach any set coverage rate, up to 100% coverage, while using the minimum number of sensors.
More
Translated text
Key words
Wireless Sensor Networks,RSSI-based Localization,Coverage holes,Voronoi diagram,Delaunay Triangulation
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined