K-Connected Target Coverage Problem in Wireless Sensor Networks

DOI10.1007/978-3-540-73556-4_5MaRDI QIDQ3611947zbMATH OpenOpenAlexFDO

Authors

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_5

zbMATH Keywords

\(k\)-connected augmentation\(k\)-connected target coverageheuristic algorithmsNP-hard problemswireless sensor networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Connected K-target coverage problem in wireless sensor networks with different observation scenarios
• Parameterized complexity of max-lifetime target coverage in wireless sensor networks
• Theoretical treatment of target coverage in wireless sensor networks

Cited in

(7)

• Designing k-coverage schedules in wireless sensor networks
• A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks
• An algorithm for minimal connected cover set problem in wireless sensor networks
• Computational Science – ICCS 2005
• A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network
• Optimization of wireless sensor networks deployment with coverage and connectivity constraints
• Connected K-target coverage problem in wireless sensor networks with different observation scenarios

This page was built for publication: K-Connected Target Coverage Problem in Wireless Sensor Networks

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