TY - GEN

T1 - Changing of the guards

T2 - 19th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2012

AU - Bar-Noy, Amotz

AU - Baumer, Ben

AU - Rawitz, Dror

PY - 2012

Y1 - 2012

N2 - 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 35/24-approximation algorithm for k-DutySC. We also give two lower bounds: 15/11, for k ≥ 4, and 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.

AB - 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 35/24-approximation algorithm for k-DutySC. We also give two lower bounds: 15/11, for k ≥ 4, and 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.

UR - http://www.scopus.com/inward/record.url?scp=84864075430&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31104-8_4

DO - 10.1007/978-3-642-31104-8_4

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84864075430

SN - 9783642311031

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 36

EP - 47

BT - Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Proceedings

Y2 - 30 June 2012 through 2 July 2012

ER -