A coverage hole detection and repair algorithm in wireless sensor networks

Coverage and connectivity are the basic issues in wireless sensor networks. In this paper, a coverage hole detection and repair algorithm is proposed to solve the problem of network disconnection. The algorithm dynamically analyzes the network topology based on the maximum simple subnet, determines the boundary node of the empty area, calculates the polygon area of the boundary node and compares it with the preset area threshold to determine the clustering strategy onto the polygon. Moreover, with activating the valid inactive nodes and make them as the cluster nodes within the empty area, the blank hole could thus be repaired and the connectivity as well as communication of the network is then managed. The simulation results show that the accuracy of hole detection is 7 and 5% higher than that of BFNP and HPA, and the coverage is 10 and 40% higher than that of BFNP and the condition without any repairing solution.

[1]  Swades De,et al.  RF energy harvester-based wake-up receiver , 2015, 2015 IEEE SENSORS.

[2]  Aman Moda,et al.  Knowledge and Awareness among Parents and General Dental Practitioners regarding Rehabilitation with Full Coverage Restoration in Children: A Multi-centric Trial , 2016, International journal of clinical pediatric dentistry.

[3]  Jie Gao,et al.  Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[4]  Rastko R. Selmic,et al.  Decentralized detection and patching of coverage holes in wireless sensor networks , 2009, Defense + Commercial Sensing.

[5]  Prasan Kumar Sahoo,et al.  An Efficient Distributed Coverage Hole Detection Protocol for Wireless Sensor Networks , 2016, Sensors.

[6]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[7]  C. K. Michael Tse,et al.  Distributed Antiflocking Algorithms for Dynamic Coverage of Mobile Sensor Networks , 2016, IEEE Transactions on Industrial Informatics.

[8]  Wei An,et al.  Coverage hole problem under sensing topology in flat wireless sensor networks , 2016, Wirel. Commun. Mob. Comput..

[9]  Yunhui Liu,et al.  Two distributed algorithms for heterogeneous sensor network deployment towards maximum coverage , 2008, 2008 IEEE International Conference on Robotics and Automation.

[10]  Kun Yang,et al.  WLC12-1: Distributed Coordinate-free Hole Detection and Recovery , 2006, IEEE Globecom 2006.

[11]  Arobinda Gupta,et al.  Line coverage measures in wireless sensor networks , 2014, J. Parallel Distributed Comput..

[12]  Abdul Hanan Abdullah,et al.  Coverage Enhancement Algorithms for Distributed Mobile Sensors Deployment in Wireless Sensor Networks , 2016, Int. J. Distributed Sens. Networks.

[13]  Prasan Kumar Sahoo,et al.  HORA: A Distributed Coverage Hole Repair Algorithm for Wireless Sensor Networks , 2015, IEEE Transactions on Mobile Computing.

[14]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

[15]  Wang Yun.  A Self-Healing Algorithm without Location Information in Sensor Networks , 2009 .

[16]  Jing Lv,et al.  Approximate Algorithms for Vertex Cover Problems in WSN Topology Design , 2015, Ad Hoc Sens. Wirel. Networks.