Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks

DOI10.1007/978-3-540-87779-0_33zbMath1161.68317OpenAlexW1510414256MaRDI QIDQ3540254

Alireza Vahdatpour, Maryam Moazeni, Foad Dabiri, Majid Sarrafzadeh

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_33

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (5)

Unnamed Item ⋮ A new bound on maximum independent set and minimum connected dominating set in unit disk graphs ⋮ A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs ⋮ An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs ⋮ Locating battery charging stations to facilitate almost shortest paths

This page was built for publication: Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks