Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Exposure in wireless sensor networks: theory and practical solutions
Wireless Networks
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Low-coordination topologies for redundancy in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Covering with Fat Convex Discs
Discrete & Computational Geometry
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
ExScal: Elements of an Extreme Scale Wireless Sensor Network
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Analysis of target detection performance for wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Verification of k-coverage on query line segments
Proceedings of the 17th International Database Engineering & Applications Symposium
Compression in wireless sensor networks: A survey and comparative evaluation
ACM Transactions on Sensor Networks (TOSN)
Partial sensing coverage with connectivity in lattice wireless sensor networks
International Journal of Sensor Networks
An efficient strategy of nonuniform sensor deployment in cyber physical systems
The Journal of Supercomputing
| Hi-index | 0.00 |
In this paper, we study the optimal deployment pattern problem in wireless sensor networks (WSNs). We propose a new set of patterns, particularly when sensors' communication range (rc) is relatively small compared with their sensing range (rs), and prove their optimality among regular patterns. In this study, we discover a surprising and interesting phenomenon-- pattern mutation. This phenomenon contradicts the conjecture presented in a previous work that there exists a universal elemental pattern among optimal pattern evolution and that pattern evolution is continuous. For example, we find mutation happens among the patterns for full-coverage and 3-connectivity when rc/rs = 1.0459, among the patterns for full-coverage and 4- connectivity when rc/rs = 1.3903, and among the patterns for full-coverage and 5-connectivity when rc/rs = 1.0406. To the best of our knowledge, this is the first time that mutation in pattern evolution has been discovered. Also, our work further completes the exploration of optimal patterns in WSNs.