Coverage and Connectivity

A major advantage of wireless sensor networks (WSNs) over wired networks is the potential for ad hoc deployment of the network. If the monitoring of a dangerous environment is required, then one may not be able to deploy a wired network.

[1]  P. Ferreira,et al.  Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach , 1992 .

[2]  Ratan K. Guha,et al.  Optimal Placement of Wireless Sensor Nodes with Fault Tolerance and Minimal Energy Consumption , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

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

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

[5]  Mohsen Eftekhari Hesari.  BARRIER COVERAGE WITH WIRELESS SENSOR NETWORKS , 2014 .

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

[7]  Rastko R. Selmic,et al.  Topological and combinatorial coverage hole detection in coordinate-free wireless sensor networks , 2016, Int. J. Sens. Networks.

[8]  Stefan Funke,et al.  Network sketching or: "How Much Geometry Hides in Connectivity?--Part II" , 2007, SODA '07.

[9]  H. Edelsbrunner.  The union of balls and its dual shape , 1995 .

[10]  Sang-Ha Kim,et al.  A Hole Geometric Modeling in Wireless Sensor Networks , 2007, 2007 International Conference on Wireless Communications, Networking and Mobile Computing.

[11]  R. Selmic,et al.  Detecting coverage holes in wireless sensor networks , 2009, 2009 17th Mediterranean Conference on Control and Automation.

[12]  Chen Zhang,et al.  ExScal: elements of an extreme scale wireless sensor network , 2005, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05).

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

[14]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[15]  Vin de Silva,et al.  Topological approximation by small simplicial complexes , 2003 .

[16]  Jianying Zhou,et al.  Applying intrusion detection systems to wireless sensor networks , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

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

[18]  Christos G. Cassandras,et al.  Sensor Networks and Cooperative Control , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

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

[20]  Bruce A. Draper,et al.  A system to place observers on a polyhedral terrain in polynomial time , 2000, Image Vis. Comput..

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

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

[23]  Wei Ren,et al.  Information consensus in multivehicle cooperative control , 2007, IEEE Control Systems.

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

[25]  Stefan Funke,et al.  Hole detection or: "how much geometry hides in connectivity?" , 2006, SCG '06.

[26]  Gyula Simon,et al.  Countersniper system for urban warfare , 2005, TOSN.

[27]  Masayuki Fujita,et al.  Coverage control for mobile networks with limited-range anisotropic sensors , 2008, 2008 47th IEEE Conference on Decision and Control.

[28]  L. Vietoris.  Über den höheren Zusammenhang kompakter Räume und eine Klasse von zusammenhangstreuen Abbildungen , 1927 .

[29]  D. Klatte.  Nonsmooth equations in optimization , 2002 .

[30]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[31]  Lorenzo Sabattini,et al.  On decentralized connectivity maintenance for mobile robotic systems , 2011, IEEE Conference on Decision and Control and European Control Conference.

[32]  F. Bullo,et al.  On collective motion in sensor networks: sample problems and distributed algorithms , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[33]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[34]  Francesco Bullo,et al.  Coordination and Geometric Optimization via Distributed Dynamical Systems , 2003, SIAM J. Control. Optim..

[35]  Sajal K. Das,et al.  Intrusion detection in sensor networks: a non-cooperative game approach , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

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

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

[38]  Matt Welsh,et al.  Deploying a wireless sensor network on an active volcano , 2006, IEEE Internet Computing.

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

[40]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[41]  Siddhartha S. Srinivasa,et al.  Decentralized estimation and control of graph connectivity in mobile sensor networks , 2008, 2008 American Control Conference.

[42]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

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

[44]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[45]  Stefan Funke,et al.  Topological hole detection in wireless sensor networks and its applications , 2005, DIALM-POMC '05.

[46]  Suman Banerjee,et al.  Node Placement for Connected Coverage in Sensor Networks , 2003 .

[47]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[48]  Mohamed Hefeeda,et al.  A Probabilistic Coverage Protocol for Wireless Sensor Networks , 2007, 2007 IEEE International Conference on Network Protocols.

[49]  Bernard M. E. Moret,et al.  Three-coloring the vertices of a triangulated simple polygon , 1992, Pattern Recognit..

[50]  Sajal K. Das,et al.  Coverage and Connectivity Issues in Wireless Sensor Networks , 2005 .

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

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

[53]  Magnus Egerstedt,et al.  Connectivity graphs as models of local interactions , 2004, CDC.