Maximizing Barrier Coverage Lifetime with Static Sensors

DOI10.1007/978-3-319-72751-6_15MaRDI QIDQ5056063zbMATH OpenOpenAlexFDO

Authors Menachem Poss, Dror Rawitz

Publication date 9 December 2022

Published in Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-72751-6_15

Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Set it and forget it: approximating the set once strip cover problem
• Maximizing Barrier Coverage Lifetime with Mobile Sensors
• Maximizing barrier coverage lifetime with mobile sensors
• ``Green barrier coverage with mobile sensors

Cites work

• Average case network lifetime on an interval with adjustable sensing ranges
• Decomposing coverings and the planar sensor cover problem
• scientific article; zbMATH DE number 6381738 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Set it and forget it: approximating the set once strip cover problem

Cited in

(6)

• ``Green barrier coverage with mobile sensors
• Maximizing barrier coverage lifetime with static sensors
• Set it and forget it: approximating the set once strip cover problem
• Maximizing barrier coverage lifetime with mobile sensors
• A better approximation ratio and an IP formulation for a sensor cover problem
• Maximizing Barrier Coverage Lifetime with Mobile Sensors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056063)