Maximum lifetime coverage preserving scheduling algorithms in sensor networks

DOI10.1007/S10898-010-9636-3zbMath1229.90028OpenAlexW1965154706MaRDI QIDQ652703

Maggie X. Cheng, Xuan Gong

Publication date: 15 December 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9636-3

zbMATH Keywords

linear programmingapproximation algorithmlifetimecoveragesensor network

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (3)

Parameterized complexity of max-lifetime target coverage in wireless sensor networks ⋮ Radar placement along banks of river ⋮ An outer-approximation approach for information-maximizing sensor selection

Cites Work

• Unnamed Item
• Mathematical programming techniques for sensor networks
• Exposure in wireless sensor networks: Theory and practical solutions
• Wireless networking, dominating and packing

This page was built for publication: Maximum lifetime coverage preserving scheduling algorithms in sensor networks