Coverage and connectivity issues in wireless sensor networks: A survey

Sensing coverage and network connectivity are two of the most fundamental problems in wireless sensor networks. Finding an optimal node deployment strategy that would minimize cost, reduce computation and communication overhead, be resilient to node failures, and provide a high degree of coverage with network connectivity is extremely challenging. Coverage and connectivity together can be treated as a measure of quality of service in a sensor network; it tells us how well each point in the region is covered and how accurate is the information gathered by the nodes. Therefore, maximizing coverage as well as maintaining network connectivity using the resource constrained nodes is a non-trivial problem. In this survey article, we present and compare several state-of-the-art algorithms and techniques that aim to address this coverage-connectivity issue.

[1]  Andreas Savvides,et al.  XYZ: a motion-enabled, power aware sensor node platform for distributed sensor network applications , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[2]  ZouYi,et al.  Sensor deployment and target localization in distributed sensor networks , 2004 .

[3]  Jan M. Rabaey,et al.  Energy aware routing for low energy ad hoc sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[4]  Patrick Thiran,et al.  Delay of intrusion detection in wireless sensor networks , 2006, MobiHoc '06.

[5]  Roger Wattenhofer,et al.  Topology control meets SINR: the scheduling complexity of arbitrary topologies , 2006, MobiHoc '06.

[6]  Brian Yamauchi,et al.  A frontier-based approach for autonomous exploration , 1997, Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation'.

[7]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[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]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[10]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[11]  Marco Conti,et al.  Mobile Ad-hoc Networking - Minitrack Introduction , 2001, HICSS.

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

[13]  Koushik Kar,et al.  Low-coordination topologies for redundancy in sensor networks , 2005, MobiHoc '05.

[14]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[15]  Alhussein A. Abouzeid,et al.  Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric , 2006, IEEE Transactions on Robotics.

[16]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[17]  D. L. Weaire,et al.  The Kelvin problem : foam structures of minimal surface area , 1996 .

[18]  S. Brendle,et al.  Calculus of Variations , 1927, Nature.

[19]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[20]  Paolo Santi.  Topology control in wireless ad hoc and sensor networks , 2005 .

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

[22]  Kuang-Ching Wang,et al.  Exposure for collaborative detection using mobile sensor networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[23]  Sajal K. Das,et al.  A framework for energy-saving data gathering using two-phase clustering in wireless sensor networks , 2004, The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2004. MOBIQUITOUS 2004..

[24]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[25]  Sajal K. Das,et al.  Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field , 2007, WADS.

[26]  Douglas W. Gage,et al.  Command Control for Many-Robot Systems , 1992 .

[27]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[28]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[29]  M. Kokar,et al.  Data vs. Decision Fusion in the Category Theory Framework , 2001 .

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

[31]  Mani B. Srivastava,et al.  Critical density thresholds for coverage in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[32]  Mark A. Shayman,et al.  Energy Efficient Routing in Wireless Sensor Networks , 2003 .

[33]  Frank L. Lewis,et al.  Energy-efficient wireless sensor network design and implementation for condition-based maintenance , 2007, TOSN.

[34]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

[35]  Gaurav S. Sukhatme,et al.  Sensor Network Configuration and the Curse of Dimensionality , 2006 .

[36]  S. Sitharama Iyengar,et al.  Sensor placement for grid coverage under imprecise detections , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[37]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[38]  Frank Thomson Leighton,et al.  Tight bounds for minimax grid matching with applications to the average case analysis of algorithms , 1989, Comb..

[39]  Leigh Burstein,et al.  Data Collection , 1985 .

[40]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[41]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[42]  Bin Ma,et al.  Deploying Wireless Sensor Networks under Limited Mobility Constraints , 2007, IEEE Transactions on Mobile Computing.

[43]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[44]  Matt Welsh,et al.  Fidelity and yield in a volcano monitoring sensor network , 2006, OSDI '06.

[45]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

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

[47]  Majid Bagheri,et al.  Randomized k-Coverage Algorithms For Dense Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[48]  Yong Gao,et al.  Analysis on the redundancy of wireless sensor networks , 2003, WSNA '03.

[49]  Jehoshua Bruck,et al.  Covering Algorithms, Continuum Percolation, and the Geometry of Wireless Networks. , 2003 .

[50]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[51]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[52]  Bhaskar Krishnamachari,et al.  Efficient Distributed Topology Control in 3-Dimensional Wireless Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

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

[54]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[55]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization in distributed sensor networks , 2004, TECS.

[56]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[57]  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).

[58]  Pramod K. Varshney,et al.  A distributed self spreading algorithm for mobile wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[59]  Paolo Santi,et al.  The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[60]  Marco Zuniga,et al.  Analyzing the transitional region in low power wireless links , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[61]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[62]  Miodrag Potkonjak,et al.  Minimal and maximal exposure path algorithms for wireless embedded sensor networks , 2003, SenSys '03.

[63]  V. S. Anil Kumar,et al.  Hardness of Set Cover with Intersection 1 , 2000, ICALP.

[64]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[65]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[66]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[67]  Michael Segal,et al.  Improved approximation algorithms for connected sensor cover , 2004, ADHOC-NOW.

[68]  Sajal K. Das,et al.  A novel framework for energy - conserving data gathering in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[69]  Himanshu Gupta,et al.  Variable radii connected sensor cover in sensor networks , 2004, SECON.

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

[71]  Ramesh Govindan,et al.  Understanding packet delivery performance in dense wireless sensor networks , 2003, SenSys '03.

[72]  Yu-Chee Tseng,et al.  The coverage problem in three-dimensional wireless sensor networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[73]  Zygmunt J. Haas,et al.  Coverage and connectivity in three-dimensional networks , 2006, MobiCom '06.

[74]  I. Rubin,et al.  Random point processes , 1977, Proceedings of the IEEE.

[75]  Frank Thomson Leighton,et al.  Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms , 1986, STOC '86.

[76]  Peter I. Corke,et al.  Data collection, storage, and retrieval with an underwater sensor network , 2005, SenSys '05.

[77]  Himanshu Gupta,et al.  Variable radii connected sensor cover in sensor networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[78]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[79]  TsengYu-Chee,et al.  The coverage problem in a wireless sensor network , 2005 .

[80]  Deborah Estrin,et al.  Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks , 2002 .

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

[82]  Yu-Chee Tseng,et al.  Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network , 2007, TOSN.

[83]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[84]  Leonidas J. Guibas,et al.  Collaborative signal and information processing: an information-directed approach , 2003 .

[85]  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).

[86]  Krishnendu Chakrabarty,et al.  Uncertainty-aware sensor deployment algorithms for surveillance applications , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

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

[88]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[89]  Tarek F. Abdelzaher,et al.  Towards optimal sleep scheduling in sensor networks for rare-event detection , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[90]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .

[91]  Sajal K. Das,et al.  Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem , 2008, IEEE Transactions on Computers.

[92]  Miodrag Potkonjak,et al.  Exposure in Wireless Sensor Networks: Theory and Practical Solutions , 2002, Wirel. Networks.

[93]  Maja J. Matarić,et al.  Cover Me! A Self-Deployment Algorithm for Mobile Sensor Networks , 2001 .

[94]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).