An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
From MaRDI portal
Publication:635294
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
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- 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
Cited in
(8)- 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
- Dominating problems in swapped networks
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- A dominating-set-based routing scheme in ad hoc wireless networks
- scientific article; zbMATH DE number 6907966 (Why is no real title available?)
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)