Covering the plane with convex polygons
Discrete & Computational Geometry
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
A survey of energy-efficient scheduling mechanisms in sensor networks
Mobile Networks and Applications
Restricted strip covering and the sensor cover problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Barrier coverage with wireless sensors
Wireless Networks
Improving network lifetime using sensors with adjustable sensing ranges
International Journal of Sensor Networks
Decomposition of multiple coverings into many parts
Computational Geometry: Theory and Applications
Cheap or Flexible Sensor Coverage
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Polynomial time approximation schemes for base station coverage with minimum total radii
Computer Networks: The International Journal of Computer and Telecommunications Networking
Decomposing Coverings and the Planar Sensor Cover Problem
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Decomposition of Multiple Coverings into More Parts
Discrete & Computational Geometry
A uniform airdrop deployment method for large-scale wireless sensor networks
International Journal of Sensor Networks
Connecting a set of circles with minimum sum of radii
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Maximizing network lifetime on the line with adjustable sensing ranges
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Changing of the guards: strip cover with duty cycling
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Brief announcement: set it and forget it - approximating the set once strip cover problem
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: set it and forget it - approximating the set once strip cover problem
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
In the Set Once Strip Cover problem n wireless sensors are deployed over a one-dimensional region. Each sensor has a battery that drains in inverse proportion to a radius that can be set just once, but activated at any time. The problem is to find an assignment of radii and activation times that maximizes the length of time during which the entire region is covered. We show that this problem is NP-hard. We also show that the approximation ratio of Round Robin, the algorithm in which the sensors take turns covering the entire region, is 3/2 in both Set Once Strip Cover and the more general Strip Cover problem, in which each radius may be set finitely-many times. Moreover, we show that the more general class of duty cycle algorithms, in which groups of sensors take turns covering the entire region, can do no better. Finally, we give an polynomial time algorithm that solves the related Set Radius Strip Cover problem, in which sensors must be activated immediately.