TY - GEN

T1 - Brief announcement

T2 - 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013

AU - Bar-Noy, Amotz

AU - Baumer, Ben

AU - Rawitz, Dror

PY - 2013

Y1 - 2013

N2 - 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 ROUNDROBIN, the algorithm in which the sensors take turns covering the entire region, is §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.

AB - 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 ROUNDROBIN, the algorithm in which the sensors take turns covering the entire region, is §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.

KW - Barrier coverage

KW - Network lifetime

KW - Strip cover

KW - Wireless sensor networks

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

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

AN - SCOPUS:84883504774

SN - 9781450315722

T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures

SP - 105

EP - 107

BT - SPAA 2013 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures

Y2 - 23 July 2013 through 25 July 2013

ER -