Maximizing Barrier Coverage Lifetime with Mobile Sensors

DOI10.1007/978-3-642-40450-4_9zbMath1394.68009OpenAlexW1755547434MaRDI QIDQ2849300

Amotz Bar-Noy, Peter Terlecky, Dror Rawitz

Publication date: 17 September 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_9

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Set it and forget it: approximating the set once strip cover problem ⋮ “Green” Barrier Coverage with Mobile Sensors ⋮ Minimizing the aggregate movements for interval coverage ⋮ ``Green barrier coverage with mobile sensors ⋮ Minimizing the Maximum Moving Cost of Interval Coverage ⋮ Complexity of barrier coverage with relocatable sensors in the plane

This page was built for publication: Maximizing Barrier Coverage Lifetime with Mobile Sensors