Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding color and shape patterns in images
Finding color and shape patterns in images
IEEE Transactions on Computers
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
Barrier coverage with wireless sensors
Wireless Networks
Matching point sets with respect to the Earth Mover's Distance
Computational Geometry: Theory and Applications
Localized sensor self-deployment with coverage guarantee
ACM SIGMOBILE Mobile Computing and Communications Review
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Approximation algorithms for computing the earth mover's distance under transformations
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Scan-Based Movement-Assisted Sensor Deployment Methods in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
On minimizing the sum ofensor movements for barrier coverage of a line segment
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Strong barrier coverage in directional sensor networks
Computer Communications
Optimal and distributed algorithms for coverage hole healing in hybrid sensor networks
International Journal of Sensor Networks
Optimal sensor networks for area monitoring using rotating and beam sensors
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Distributed algorithms for barrier coverage using relocatable sensors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the line. An intruder traversing the barrier can be detected only when it is within the sensing range of at least one sensor. The sensor network establishes barrier coverage of the segment if no intruder can penetrate the barrier from any direction in the plane without being detected. Starting from arbitrary initial positions of sensors on the line we are interested in finding final positions of sensors that establish barrier coverage and minimize the maximum distance traversed by any sensor. We distinguish several variants of the problem, based on (a) whether or not the sensors have identical ranges, (b) whether or not complete coverage is possible and (c) in the case when complete coverage is impossible, whether or not the maximal coverage is required to be contiguous. For the case of n sensors with identical range, when complete coverage is impossible, we give linear time optimal algorithms that achieve maximal coverage, both for the contiguous and non-contiguous case. When complete coverage is possible, we give an O (n 2) algorithm for an optimal solution, a linear time approximation scheme with approximation factor 2, and a (1 + *** ) PTAS. When the sensors have unequal ranges we show that a variation of the problem is NP-complete and identify some instances which can be solved with our algorithms for sensors with unequal ranges.