TY - GEN
T1 - Maximizing barrier coverage lifetime with static sensors
AU - Poss, Menachem
AU - Rawitz, Dror
N1 - Publisher Copyright: © Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - We study variants of the Strip Cover problem (SC) in which sensors with limited battery power are deployed on a line barrier, and the goal is to cover the barrier as long as possible. The energy consumption of a sensor depends on its sensing radius: energy is drained in inverse proportion to the sensor radius raised to a constant exponent α≥ 1. In the Set Once Strip Cover (OnceSC) the radius of each sensor can be set once, and the sensor can be activated at any time. SCk and ONCESCk are variants of SC and OnceSC, resp., in which each sensor is associated with a set of at most k predetermined radii. It was previously known that OnceSC is NP-hard when α=1, and the complexity of the case where α> 1 remained open. We extend the above mentioned NP-hardness result in two ways: we show that OnceSC is NP-hard for every α> 1 and that OnceSC is strongly NP-hard for α=1. In addition, we show that ONCESCk, for k≥ 2, is NP-hard, for any α≥ 1, even for uniform radii sets. On the positive side, we present (i) a 5 γα-approximation algorithm for ONCESCk, for k≥ 1, where γ is the maximum ratio between two radii associated with the same sensor; (ii) a 5-approximation algorithm for SCk, for every k≥1; and (iii) a 5 · 2α-approximation algorithm for Strip Cover. Finally, we present an O(nlog n)-time algorithm for a variant of ONCESCk in which all sensors must be activated at the same time.
AB - We study variants of the Strip Cover problem (SC) in which sensors with limited battery power are deployed on a line barrier, and the goal is to cover the barrier as long as possible. The energy consumption of a sensor depends on its sensing radius: energy is drained in inverse proportion to the sensor radius raised to a constant exponent α≥ 1. In the Set Once Strip Cover (OnceSC) the radius of each sensor can be set once, and the sensor can be activated at any time. SCk and ONCESCk are variants of SC and OnceSC, resp., in which each sensor is associated with a set of at most k predetermined radii. It was previously known that OnceSC is NP-hard when α=1, and the complexity of the case where α> 1 remained open. We extend the above mentioned NP-hardness result in two ways: we show that OnceSC is NP-hard for every α> 1 and that OnceSC is strongly NP-hard for α=1. In addition, we show that ONCESCk, for k≥ 2, is NP-hard, for any α≥ 1, even for uniform radii sets. On the positive side, we present (i) a 5 γα-approximation algorithm for ONCESCk, for k≥ 1, where γ is the maximum ratio between two radii associated with the same sensor; (ii) a 5-approximation algorithm for SCk, for every k≥1; and (iii) a 5 · 2α-approximation algorithm for Strip Cover. Finally, we present an O(nlog n)-time algorithm for a variant of ONCESCk in which all sensors must be activated at the same time.
UR - http://www.scopus.com/inward/record.url?scp=85040095188&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-319-72751-6_15
DO - https://doi.org/10.1007/978-3-319-72751-6_15
M3 - منشور من مؤتمر
SN - 9783319727509
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 198
EP - 210
BT - Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers
A2 - Mosteiro, Miguel A.
A2 - Jurdzinski, Tomasz
A2 - Fernandez Anta, Antonio
A2 - Zhang, Yanyong
PB - Springer Verlag
T2 - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017
Y2 - 4 September 2017 through 8 September 2017
ER -