Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks
- 21 August 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 9 (3) , 435-448
- https://doi.org/10.1109/tmc.2009.143
Abstract
In this paper, we study optimal deployment in terms of the number of sensors required to achieve four-connectivity and full coverage under different ratios of sensors' communication range (denoted by rc) to their sensing range (denoted by rs). We propose a new pattern, the Diamond pattern, which can be viewed as a series of evolving patterns. When rc/rs ¿ ¿(3), the Diamond pattern coincides with the well-known triangle lattice pattern; when rc/rs ¿ ¿(2), it degenerates to a Square pattern (i.e., a square grid). We prove that our proposed pattern is asymptotically optimal when rc/rs > ¿(2) to achieve four-connectivity and full coverage. We also discover another new deployment pattern called the Double-strip pattern. This pattern provides a new aspect to research on optimal deployment patterns. Our work is the first to propose an asymptotically optimal deployment pattern to achieve four-connectivity and full coverage for WSNs. Our work also provides insights on how optimal patterns evolve and how to search for them.Keywords
This publication has 25 references indexed in Scilit:
- Designing localized algorithms for barrier coveragePublished by Association for Computing Machinery (ACM) ,2007
- Improved Approximation Algorithms for Geometric Set CoverDiscrete & Computational Geometry, 2006
- Maintaining Sensing Coverage and Connectivity in Large Sensor NetworksPublished by Taylor & Francis ,2005
- Low-coordination topologies for redundancy in sensor networksPublished by Association for Computing Machinery (ACM) ,2005
- Covering with Fat Convex DiscsDiscrete & Computational Geometry, 2005
- A line in the sand: a wireless sensor network for target detection, classification, and trackingPublished by Elsevier ,2004
- Set k-cover algorithms for energy efficient monitoring in wireless sensor networksPublished by Association for Computing Machinery (ACM) ,2004
- Covering a set of points in multidimensional spaceInformation Processing Letters, 1991
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- The Number of Circles Covering a SetAmerican Journal of Mathematics, 1939