Distributed Coordinate-free Hole Detection and Recovery

A distributed algorithm is introduced which detects and recovers holes in the coverage provided by wireless sensor networks. It does not require coordinates, requiring only minimal connectivity information (for example, whether any two nodes are within either the sensing radius or twice the sensing radius.) The radio communications area is assumed to be larger than the sensed area. Two active nodes are called neighbors, and are said to be connected by a link, if their distance lies between these two values. Redundant nodes are likely to exist inside an active node's sensing range. If all connected neighbors of some active node A can form a ring via links between them, there is no large hole inside the ring. Otherwise A is a boundary node of a large hole. All boundary nodes and most holes can be detected with very low probability of error, and simulation results suggest that redundant nodes are selected efficiently for activation when recovering the hole.

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

[2]  Jie Wu,et al.  Coverage issue in sensor networks with adjustable ranges , 2004 .

[3]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

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

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

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

[8]  Hongwei Zhang,et al.  GS3: scalable self-configuration and self-healing in wireless networks , 2002, PODC '02.

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

[10]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[11]  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..

[12]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

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

[14]  Xiaofei Wang,et al.  Self-organizing redundancy-cellular architecture for wireless sensor networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[15]  Wenhua Dou,et al.  A Coverage-Preserving Density Control Algorithm for Wireless Sensor Networks , 2004, ADHOC-NOW.

[16]  Deborah Estrin,et al.  Self-configuring localization systems: Design and Experimental Evaluation , 2004, TECS.

[17]  Jan Vitek,et al.  Coverage preserving redundancy elimination in sensor networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[18]  Tian He,et al.  Differentiated surveillance for sensor networks , 2003, SenSys '03.