Computational geometry based distributed coverage hole detection protocol for the wireless sensor networks

Authors:
Hwa-Chun Ma;Prasan Kumar Sahoo;Yen-Wen Chen
Affiliations:
Department of Communication Engineering, National Central University, Jhongli 32001, Taiwan, ROC and Department of Information Management, China University of Technology, Taipei 11695, Taiwan, ROC;Department of Computer Science and Information Engineering, Chang Gung University, Kwei-Shan 33302, Taiwan, ROC;Department of Communication Engineering, National Central University, Jhongli 32001, Taiwan, ROC
Venue:
Journal of Network and Computer Applications
Year:
2011

Citing 7
Cited 2

Mobility improves coverage of sensor networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
The holes problem in wireless sensor networks: a survey

ACM SIGMOBILE Mobile Computing and Communications Review
Topological hole detection in wireless sensor networks and its applications

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Hole detection or: "how much geometry hides in connectivity?"

Proceedings of the twenty-second annual symposium on Computational geometry
Boundary recognition in sensor networks by topological methods

Proceedings of the 12th annual international conference on Mobile computing and networking
Energy-Efficient Predictive Jamming Holes Detection Protocol for Wireless Sensor Networks

SENSORCOMM '08 Proceedings of the 2008 Second International Conference on Sensor Technologies and Applications
Coverage by randomly deployed wireless sensor networks

IEEE Transactions on Information Theory

DLS: A dynamic local stitching mechanism to rectify transmitting path fragments in wireless sensor networks

Journal of Network and Computer Applications
Energy consumption bounds analysis and its applications for grid based wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless sensor networks, the purpose of surveillance cannot be fulfilled if coverage holes are generated due to accidental death of the nodes caused due to technical failures, explosions and malicious activities or power exhaustion. Since, sensors are normally deployed randomly over the dense forests and harsh terrains, it is not possible to find out the coverage holes manually. Hence, in this work a computational geometry approach based distributed hole detection protocol is designed to find out the coverage holes in a post deployment scenario. An efficient geometric method with proper theoretical basis is used to detect the coverage holes of the wireless sensor network, where communication and sensing range of the nodes are same. Performance evaluation of our protocol shows that the hole detection time and energy consumption due to hole detection outperforms over similar hole detection protocols.