A randomized art-gallery algorithm for sensor placement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Sensor deployment strategy for target detection
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On deriving the upper bound of α-lifetime for large sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Data storage placement in sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Analysis of a wireless sensor dropping problem in wide-area environmental monitoring
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Reliable density estimates for coverage and connectivity in thin strips of finite length
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Fast Sensor Placement Algorithms for Fusion-Based Target Detection
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Barrier coverage with sensors of limited mobility
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
ROC: resilient online coverage for surveillance applications
IEEE/ACM Transactions on Networking (TON)
Employing energy-efficient patterns for coverage problem to extend the network lifetime
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part IV
Constructing sensor barriers with minimum cost in wireless sensor networks
Journal of Parallel and Distributed Computing
Distributed algorithms for barrier coverage using relocatable sensors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Barrier coverage with line-based deployed mobile sensors
Ad Hoc Networks
Sweep-coverage with energy-restricted mobile wireless sensor nodes
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.00 |
Deploying wireless sensor networks to provide guaranteed barrier coverage is critical for many sensor networks applications such as intrusion detection and border surveillance. To reduce the number of sensors needed to provide guaranteed barrier coverage, we propose multi-round sensor deployment which splits sensor deployment into multiple rounds and can better deal with placement errors that often accompany sensor deployment. We conduct a comprehensive analytical study on multi-round sensor deployment and identify the tradeoff between the number of sensors deployed in each round of multiround sensor deployment and the barrier coverage performance. Both numerical and simulation studies show that, by simply splitting sensor deployment into two rounds, guaranteed barrier coverage can be achieved with significantly less sensors comparing to singleround sensor deployment. Moreover, we propose two practical solutions for multi-round sensor deployment when the distribution of a sensor's residence point is not fully known. The effectiveness of the proposed multi-round sensor deployment strategies is demonstrated by numerical and simulation results.