Hybrid approximation for minimum-cost target coverage in wireless sensor networks

DOI10.1007/S11590-009-0167-0MaRDI QIDQ1958636zbMATH OpenOpenAlexFDO

Authors Zheng Fang, Jie Wang

Publication date 4 October 2010

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-009-0167-0

zbMATH Keywords

LP-roundingminimum set multicoverpoint coveragesensor deployment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• New approximations for maximum lifetime coverage
• A Lagrangean-based heuristics for the target covering problem in wireless sensor network
• Efficient point coverage in wireless sensor networks

Cites work

• Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks
• Efficient point coverage in wireless sensor networks

Cited in

(5)

• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
• Constant-approximation for prize-collecting min-sensor sweep coverage with base stations
• Model of minimum cost heterogeneous sensor network
• scientific article; zbMATH DE number 7267220 (Why is no real title available?)
• New approximations for maximum lifetime coverage

This page was built for publication: Hybrid approximation for minimum-cost target coverage in wireless sensor networks

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