Optimal Coverage in Wireless Sensor Networks

DOI10.1007/978-3-030-52824-9zbMath1486.90002OpenAlexW3091083245MaRDI QIDQ5119165

Weili Wu, Ding-Zhu Du, Zhao Zhang, Won Jun Lee

Publication date: 3 September 2020

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-52824-9

zbMATH Keywords

optimizationwireless sensor networksalgorithms and problems complexitycoverage and connectivity problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (8)

Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage ⋮ Constant-approximation for prize-collecting min-sensor sweep coverage with base stations ⋮ Approximation algorithm for prize-collecting sweep cover with base stations ⋮ An approximation algorithm for general energy restricted sweep coverage problem ⋮ A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems ⋮ Construction of minimum edge-fault tolerant connected dominating set in a general graph ⋮ Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks ⋮ Theoretical design of decentralized auction framework under mobile crowdsourcing environment

This page was built for publication: Optimal Coverage in Wireless Sensor Networks