An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks

DOI10.1016/j.jpdc.2010.05.008zbMath1219.68060OpenAlexW2077501225MaRDI QIDQ635294

Yi Shang, Hongchi Shi, Bolian Yin

Publication date: 19 August 2011

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.05.008

zbMATH Keywords

ad hoc networksconnected dominating setdynamic topologydistributed clustering algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Dominating problems in swapped networks ⋮ Finding minimum weight connected dominating set in stochastic graph based on learning automata

Cites Work

• Unnamed Item
• Approximation algorithms for connected dominating sets
• Distributed dynamic channel access scheduling for ad hoc networks.
• Fast Distributed Construction of Smallk-Dominating Sets and Applications
• Constant-time distributed dominating set approximation

This page was built for publication: An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks