Covering the plane with convex polygons
Discrete & Computational Geometry
Combinatorial optimization
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Restricted strip covering and the sensor cover problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
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
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 |
The notion of duty cycling is common in problems which seek to maximize the lifetime of a wireless sensor network. In the duty cycling model, sensors are grouped into shifts that take turns covering the region in question, and each sensor can belong to at most one shift. We consider the imposition of the duty cycling model upon the Strip Cover problem, where we are given n sensors on a one-dimensional region, and each shift can contain at most k≤n sensors. We call the problem of finding the optimal set of shifts so as to maximize the length of time that the entire region can be covered by a wireless sensor network, k-Duty Cycle Strip Cover (k-DutySC). In this paper, we present a polynomial-time algorithm for 2-DutySC. Furthermore, we show that this algorithm is a $\frac{35}{24}$-approximation algorithm for k-DutySC. We also give two lower bounds: $\frac{15}{11}$, for k≥4, and $\frac{6}{5}$, for k=3, and provide experimental evidence suggesting that these lower bounds are tight. Finally, we propose a fault tolerance model and find thresholds on the sensor failure rate, over which our algorithm has the highest expected performance.