``Green barrier coverage with mobile sensors

DOI10.1016/j.tcs.2021.01.034zbMath1497.68053OpenAlexW3124911530MaRDI QIDQ1998844

Amotz Bar-Noy, Dror Rawitz, Peter Terlecky, Erlebach, Thomas

Publication date: 9 March 2021

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

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

zbMATH Keywords

energy conservationapproximation algorithmssensor networksmobile sensorsbarrier coveragesensor deployment

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Changing of the guards: strip cover with duty cycling
• Covering a line segment with variable radius discs
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Connecting a set of circles with minimum sum of radii
• Complexity of barrier coverage with relocatable sensors in the plane
• Average case network lifetime on an interval with adjustable sensing ranges
• Set it and forget it: approximating the set once strip cover problem
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Maximizing Barrier Coverage Lifetime with Mobile Sensors
• Minimizing movement
• New Algorithms for Barrier Coverage with Mobile Sensors
• Maximizing Barrier Coverage Lifetime with Static Sensors
• Decomposing Coverings and the Planar Sensor Cover Problem

This page was built for publication: ``Green barrier coverage with mobile sensors