Maximizing Barrier Coverage Lifetime with Mobile Sensors

DOI10.1137/16M1071031zbMath1370.68327arXiv1304.6358MaRDI QIDQ5346541

Amotz Bar-Noy, Peter Terlecky, Dror Rawitz

Publication date: 24 May 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.6358

zbMATH Keywords

approximation algorithmssensor networksnetwork lifetimemobile sensorsbarrier coveragesensor deployment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Minimizing the total cost of barrier coverage in a linear domain

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
• Average case network lifetime on an interval with adjustable sensing ranges
• Set it and forget it: approximating the set once strip cover problem
• “Green” Barrier Coverage with Mobile Sensors
• New Algorithms for Barrier Coverage with Mobile Sensors
• Decomposing Coverings and the Planar Sensor Cover Problem

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