Changing of the guards: strip cover with duty cycling

DOI10.1016/j.tcs.2014.09.002zbMath1332.68021OpenAlexW2176769465MaRDI QIDQ896691

Ben Baumer, Amotz Bar-Noy, Dror Rawitz

Publication date: 10 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.002

zbMATH Keywords

approximation algorithmswireless sensor networksadjustable rangesduty cyclingstrip cover

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (3)

``Green barrier coverage with mobile sensors ⋮ Maximizing barrier coverage lifetime with static sensors ⋮ Maximizing Barrier Coverage Lifetime with Mobile Sensors

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition of multiple coverings into more parts
• Decomposition of multiple coverings into many parts
• Covering the plane with convex polygons
• Connecting a set of circles with minimum sum of radii
• Set it and forget it: approximating the set once strip cover problem
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Decomposing Coverings and the Planar Sensor Cover Problem

This page was built for publication: Changing of the guards: strip cover with duty cycling