Pattern mutation in wireless sensor deployment

Authors:
Ziqiu Yun;Xiaole Bai;Dong Xuan;Weijia Jia;Wei Zhao
Affiliations:
Department of Mathematics, Soochow University, Suzhou, China;Advanced Analytics Department, Alliance Data Systems Corporation, Columbus, OH;Department of Computer Science and Engineering, The Ohio State University, Columbus, OH;Department of Computer Science, City University of Hong Kong, Hong Kong;Department of Computer and Information Science, University of Macau, Macau, China
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 14
Cited 1

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
Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks

IEEE Transactions on Mobile Computing
Optimal deployment patterns for full coverage and k- connectivity (k ≤ 6) wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Analysis of target detection performance for wireless sensor networks

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems

Partial sensing coverage with connectivity in lattice wireless sensor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 to their sensing range (rs), and prove their optimality. In this study, we discover an interesting phenomenon--pattern mutation. To the best of our knowledge, this is the first time that mutation in pattern deployments has been discovered. This phenomenon, which contradicts the conjecture presented in a previous work that there exists a universal elemental pattern among optimal pattern deployment, significantly furthers our understanding of optimal patterns in WSNs.