Maximizing barrier coverage lifetime with static sensors

DOI10.1007/s10951-022-00736-8zbMath1501.90032OpenAlexW4281382081MaRDI QIDQ2093181

Dror Rawitz, Menachem Poss

Publication date: 4 November 2022

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-022-00736-8

zbMATH Keywords

approximation algorithmsensor networksnetwork lifetimebarrier coveragestrip cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Changing of the guards: strip cover with duty cycling
• Average case network lifetime on an interval with adjustable sensing ranges
• Set it and forget it: approximating the set once strip cover problem
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Decomposing Coverings and the Planar Sensor Cover Problem

This page was built for publication: Maximizing barrier coverage lifetime with static sensors