Optimal and distributed algorithms for coverage hole healing in hybrid sensor networks

Network coverage is one of the most decisive factors for determining the efficiency of a WSN. In this paper, we focus on how to schedule mobile sensors in order to cope with coverage hole issues in a hybrid WSN containing both static and mobile sensors. To this end, we introduce a new metric, namely to maximise the minimum remaining energy of all moved sensors since the more energy remains, the longer the network can operate. Based on this metric, we propose an efficient coverage healing algorithm that always determines an optimal location for each mobile sensor in order to heal all coverage holes, after all mobile sensors locations and coverage holes are located. When the target area is too big, we present a scalable area-based algorithm which returns a near optimal solution. Furthermore, we also present a lightweight-distributed scheduling strategy for mobile sensors in case of small sensor failures.

[1]  Xu Li,et al.  ZONER: A ZONE-based Sensor Relocation Protocol for Mobile Sensor Networks , 2006, Proceedings. 2006 31st IEEE Conference on Local Computer Networks.

[2]  Andreas Willig,et al.  Data Transport Reliability in Wireless Sensor Networks. A Survey of Issues and Solutions , 2005, PIK Prax. Informationsverarbeitung Kommun..

[3]  Lihua Xie,et al.  A consensus approach to the assignment problem: Application to mobile sensor dispatch , 2010, IEEE ICCA 2010.

[4]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[5]  Wei Wang,et al.  Trade-offs between mobility and density for coverage in wireless sensor networks , 2007, MobiCom '07.

[6]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Gaurav S. Sukhatme,et al.  Robomote: a tiny mobile robot platform for large-scale ad-hoc sensor networks , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

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

[9]  Thomas F. La Porta,et al.  Movement-Assisted Sensor Deployment , 2006, IEEE Trans. Mob. Comput..

[10]  Thomas F. La Porta,et al.  Sensor relocation in mobile sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[12]  Ivan Stojmenovic,et al.  Mesh-Based Sensor Relocation for Coverage Maintenance in Mobile Sensor Networks , 2007, UIC.

[13]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[14]  Jorge Urrutia,et al.  On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment , 2010, ADHOC-NOW.

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

[16]  B. R. Badrinath,et al.  Prediction-based energy map for wireless sensor networks , 2003, Ad Hoc Networks.