An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
From MaRDI portal
Publication:635294
DOI10.1016/J.JPDC.2010.05.008zbMATH Open1219.68060OpenAlexW2077501225MaRDI QIDQ635294FDOQ635294
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
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
Cited In (8)
- Title not available (Why is that?)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc 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
- Finding minimum weight connected dominating set in stochastic graph based on learning automata
- A dominating-set-based routing scheme in ad hoc wireless networks
- Dominating problems in swapped networks
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)