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

DOI10.1016/J.JPDC.2010.05.008MaRDI QIDQ635294zbMATH OpenOpenAlexFDO

Authors Bolian Yin, Hongchi Shi, Yi Shang

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 setdistributed clustering algorithmdynamic topology

Mathematics Subject Classification ID

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

Recommendations

• Distributed routing algorithms for multi-hop ad hoc networks using \(d\)-hop connected \(d\)-dominating sets
• Distributed algorithms for connected domination in wireless networks
• An algorithm to determine minimum velocity-based stable connected dominating sets for ad hoc networks
• An effective connected dominating set based mobility management algorithm in manets
• Algorithms for minimum connected capacitated dominating set problem

Cites work

• Approximation algorithms for connected dominating sets
• Constant-time distributed dominating set approximation
• Distributed dynamic channel access scheduling for ad hoc networks.
• Fast Distributed Construction of Smallk-Dominating Sets and Applications
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(8)

• Construction of strongly connected dominating sets in asymmetric multihop wireless networks
• An effective connected dominating set based mobility management algorithm in manets
• Dominating problems in swapped networks
• An algorithm to determine minimum velocity-based stable connected dominating sets for ad hoc networks
• scientific article; zbMATH DE number 6907966 (Why is no real title available?)
• A dominating-set-based routing scheme in ad hoc wireless networks
• Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
• Finding minimum weight connected dominating set in stochastic graph based on learning automata

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

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