Coverage hole detection algorithm without location information in wireless sensor networks

In this paper, we propose a simple and accurate coverage hole detection algorithm without location information for wireless sensor networks. The coverage hole detection algorithm consists of two components, named boundary edge detection and boundary cycle detection. In the first component, we use a graph to model the wireless sensor network, and each edge in the graph is checked to determine whether it is a boundary edge or not. In the second component, the boundary cycles of all coverage holes are discovered to localize each coverage hole. By comparing with a location based algorithm, it is shown that our proposed algorithm can accurately detect over 99% coverage holes.

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

[2]  Dragos Niculescu,et al.  Positioning in ad hoc sensor networks , 2004, IEEE Network.

[3]  Yigal Bejerano,et al.  Generic Coverage Verification Without Location Information Using Dimension Reduction , 2009, IEEE/ACM Transactions on Networking.

[4]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[5]  Yigal Bejerano,et al.  Simple and Efficient k-Coverage Verification without Location Information , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[6]  Haitao Liu,et al.  The Localization of Wireless Sensor Network Nodes Based on Dsss , 2006, 2006 IEEE International Conference on Electro/Information Technology.

[7]  Yigal Bejerano,et al.  Coverage Verification without Location Information , 2012, IEEE Transactions on Mobile Computing.

[8]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[9]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[10]  Kaveh Pahlavan,et al.  Modeling of the TOA-based distance measurement error using UWB indoor radio measurements , 2006, IEEE Communications Letters.

[11]  Anthony Man-Cho So,et al.  On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams , 2005, WINE.

[12]  Philippe Martins,et al.  Homology-Based Distributed Coverage Hole Detection in Wireless Sensor Networks , 2013, IEEE/ACM Transactions on Networking.

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

[14]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[15]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

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

[17]  Abubakr Muhammad,et al.  Blind Swarms for Coverage in 2-D , 2005, Robotics: Science and Systems.