A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks

DOI10.1007/978-3-540-69311-6_24zbMath1143.68633OpenAlexW1479999284MaRDI QIDQ3507337

Zhiping Cai, Min Li, Yongan Wu, En Zhu

Publication date: 19 June 2008

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69311-6_24

zbMATH Keywords

probabilistic model(\(\theta \) and \(k\))-coverage\(\alpha \)-connectivitydense sensor networks

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• \(\epsilon\)-nets and simplex range queries
• Almost optimal set covers in finite VC-dimension
• Grid coverage for surveillance and target location in distributed sensor networks

This page was built for publication: A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks