“Green” Barrier Coverage with Mobile Sensors

DOI10.1007/978-3-319-18173-8_2zbMath1459.68020OpenAlexW998847277MaRDI QIDQ2947008

Peter Terlecky, Amotz Bar-Noy, Dror Rawitz

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18173-8_2

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)

Related Items (1)

Maximizing Barrier Coverage Lifetime with Mobile Sensors

Cites Work

• Unnamed Item
• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Covering a line segment with variable radius discs
• Optimal movement of mobile sensors for barrier coverage of a planar region
• 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
• Changing of the Guards: Strip Cover with Duty Cycling
• Minimizing movement
• New Algorithms for Barrier Coverage with Mobile Sensors
• Complexity of Barrier Coverage with Relocatable Sensors in the Plane
• Decomposing Coverings and the Planar Sensor Cover Problem

This page was built for publication: “Green” Barrier Coverage with Mobile Sensors