``Green barrier coverage with mobile sensors
From MaRDI portal
Publication:1998844
Recommendations
Cites work
- Average case network lifetime on an interval with adjustable sensing ranges
- Changing of the guards: strip cover with duty cycling
- Complexity of barrier coverage with relocatable sensors in the plane
- Covering a line segment with variable radius discs
- 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 2107164 (Why is no real title available?)
- Maximizing barrier coverage lifetime with mobile sensors
- Maximizing Barrier Coverage Lifetime with Static Sensors
- Minimizing movement
- New Algorithms for Barrier Coverage with Mobile Sensors
- Optimal movement of mobile sensors for barrier coverage of a planar region
- 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
(11)- Maximizing barrier coverage lifetime with static sensors
- A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement
- On the displacement for covering a unit interval with randomly placed sensors
- Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane
- Maximizing barrier coverage lifetime with mobile sensors
- ``Green barrier coverage with mobile sensors
- Distributed coverage games for energy-aware mobile sensor networks
- Maximizing Barrier Coverage Lifetime with Static Sensors
- Maximizing Barrier Coverage Lifetime with Mobile Sensors
- Energy Efficient Monitoring in Sensor Networks
- Minimizing the total cost of barrier coverage in a linear domain
This page was built for publication: ``Green barrier coverage with mobile sensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998844)