More is more: The benefits of dense sensor deployment

An ad-hoc sensor network is composed of sensing devices which can measure or detect features of their environment, communicate with one other and possibly with other devices that perform data fusion. One of the problems motivated by ad-hoc sensor networks is to position sensors in order to maximize coverage, or equivalently to minimize the number of sensors required to cover a given area.

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

[2]  Esther M. Arkin,et al.  Minimum-cost coverage of point sets by disks , 2006, SCG '06.

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

[4]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[5]  Peter Braß.  Bounds on coverage and target detection capabilities for models of networks of mobile sensors , 2007, TOSN.

[6]  J. Pach,et al.  Combinatorial geometry , 1995, Wiley-Interscience series in discrete mathematics and optimization.

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

[8]  Krishnendu Chakrabarty,et al.  Uncertainty-aware and coverage-oriented deployment for sensor networks , 2004, J. Parallel Distributed Comput..

[9]  János Pach,et al.  Research problems in discrete geometry , 2005 .

[10]  N. J. A. Sloane,et al.  On sublattices of the hexagonal lattice , 1997, Discret. Math..

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

[12]  János Pach,et al.  Decomposition of multiple coverings into many parts , 2009, Comput. Geom..

[13]  Matthew P. Johnson,et al.  Geometric considerations for distribution of sensors in ad-hoc sensor networks , 2007, SPIE Defense + Commercial Sensing.

[14]  Dinesh C. Verma,et al.  A sensor placement algorithm for redundant covering based on Riesz energy minimization , 2008, 2008 IEEE International Symposium on Circuits and Systems.

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

[16]  Samir R. Das,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2006, TNET.

[17]  Yu-Chee Tseng,et al.  Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage , 2008 .

[18]  Jennifer C. Hou,et al.  Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[19]  Andreas Seeger,et al.  Mean square discrepancy bounds for the number of lattice points in large convex bodies , 2002 .

[20]  János Pach,et al.  Combinatorial Geometry , 2012 .

[21]  János Pach,et al.  Decomposition of multiple coverings into many parts , 2007, SCG '07.

[22]  Michael Segal,et al.  Improved approximation algorithms for connected sensor cover , 2007, Wirel. Networks.

[23]  Annalisa Massini,et al.  Snap and Spread: A Self-deployment Algorithm for Mobile Sensor Networks , 2008, DCOSS.