Coverage hole and boundary nodes detection in wireless sensor networks

Full coverage is critical for the applications of surveillance and monitoring in wireless sensor networks (WSNs). However, the emergence of coverage holes is unavoidable generally due to various reasons. In this paper, we propose a novel algorithm using the properties of empty circles to evaluate whether coverage holes exist or not in WSNs and to identify the exact nodes on the boundaries of holes. Our algorithm is divided into two phases: (1) coverage hole detection and coarse boundary nodes clustering and (2) boundary nodes refining. We show the correctness of our algorithm by theoretical proofs. Simulation results confirm that our algorithm can detect all the coverage holes, and our algorithm has better performance in boundary nodes recognition compared with other similar works.

[1]  Sándor P. Fekete,et al.  Neighborhood-Based Topology Recognition in Sensor Networks , 2004, ALGOSENSORS.

[2]  Bernie Mulgrew,et al.  Proceedings IEEE International Conference on Communications , 1989 .

[3]  Sang-Ha Kim,et al.  Hole modeling and detour scheme for geographic routing in wireless sensor networks , 2009, Journal of Communications and Networks.

[4]  Donald F. Towsley,et al.  Dynamic Coverage of Mobile Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[5]  Xiang-Yang Li,et al.  Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[6]  A. Ghosh,et al.  Estimating coverage holes and enhancing coverage in mixed sensor networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[7]  Prasan Kumar Sahoo,et al.  Computational geometry based distributed coverage hole detection protocol for the wireless sensor networks , 2011, J. Netw. Comput. Appl..

[8]  Xiang-Yang Li,et al.  Coverage in Wireless Ad Hoc Sensor Networks , 2003, IEEE Trans. Computers.

[9]  Jun Zheng,et al.  Geographic hole-bypassing forwarding protocol for wireless sensor networks , 2011, IET Commun..

[10]  Brian D. O. Anderson,et al.  Wireless sensor network localization techniques , 2007, Comput. Networks.

[11]  Yuguang Fang,et al.  Localized algorithms for coverage boundary detection in wireless sensor networks , 2007, Wirel. Networks.

[12]  Thomas F. La Porta,et al.  A bidding protocol for deploying mobile sensors , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[13]  Stefan Funke,et al.  Topological hole detection in wireless sensor networks and its applications , 2005, DIALM-POMC '05.

[14]  Sándor P. Fekete,et al.  Deterministic boundary recognition and topology extraction for large sensor networks , 2005, SODA '06.

[15]  R. Selmic,et al.  Detecting coverage holes in wireless sensor networks , 2009, 2009 17th Mediterranean Conference on Control and Automation.

[16]  Jie Gao,et al.  Boundary recognition in sensor networks by topological methods , 2006, MobiCom '06.

[17]  Haiying Shen,et al.  A Delaunay-Based Coordinate-Free Mechanism for Full Coverage in Wireless Sensor Networks , 2014, IEEE Trans. Parallel Distributed Syst..

[18]  Pedro José Marrón,et al.  On boundary recognition without location information in wireless sensor networks , 2010, ACM Trans. Sens. Networks.

[19]  Stefan Funke,et al.  Hole detection or: "how much geometry hides in connectivity?" , 2006, SCG '06.

[20]  Leonidas J. Guibas,et al.  Locating and Bypassing Holes in Sensor Networks , 2006, Mob. Networks Appl..

[21]  Massimo Franceschetti,et al.  Percolation in Multi-hop Wireless Networks , 2003 .

[22]  Thomas F. La Porta,et al.  Bidding Protocols for Deploying Mobile Sensors , 2007, IEEE Transactions on Mobile Computing.

[23]  Abubakr Muhammad,et al.  Coverage and hole-detection in sensor networks via homology , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..