New distributed algorithm for connected dominating set in wireless ad hoc networks
@article{Alzoubi2002NewDA, title={New distributed algorithm for connected dominating set in wireless ad hoc networks}, author={Khaled M. Alzoubi and P. Wan and O. Frieder}, journal={Proceedings of the 35th Annual Hawaii International Conference on System Sciences}, year={2002}, pages={3849-3855} }
Connected dominating set (CDs) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. We first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms can not guarantee to generate a CDs of small size. Their message complexities can be as high as O(n/sup 2/), and their time complexities may also be as large as O(n/sup… CONTINUE READING
Supplemental Presentations
Figures, Tables, and Topics from this paper
339 Citations
Distributed algorithms for connected domination in wireless networks
- Computer Science
- J. Parallel Distributed Comput.
- 2007
- 31
- PDF
Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks
- Computer Science
- 2004
- 43
- Highly Influenced
Distributed Construction of Weakly Connected Dominating Sets for Clustering Mobile Ad Hoc Networks
- Computer Science
- J. Digit. Inf. Manag.
- 2005
- PDF
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
- Mathematics, Computer Science
- FSTTCS
- 2004
- 52
- Highly Influenced
- PDF
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
- Computer Science
- IEEE Transactions on Parallel and Distributed Systems
- 2009
- 180
- PDF
Message-optimal connected dominating sets in mobile ad hoc networks
- Computer Science
- MobiHoc '02
- 2002
- 415
- PDF
A Constant Factor Distributed Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks
- 6
- Highly Influenced
- PDF
Distributed heuristics for connected dominating sets in wireless ad hoc networks
- Computer Science
- Journal of Communications and Networks
- 2002
- 258
- PDF
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
- Computer Science
- IEEE Transactions on Mobile Computing
- 2007
- 166
- PDF
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
- Computer Science
- MobiHoc '08
- 2008
- 95
- PDF
References
SHOWING 1-10 OF 16 REFERENCES
Routing in ad-hoc networks using minimum connected dominating sets
- Computer Science
- Proceedings of ICC'97 - International Conference on Communications
- 1997
- 866
- Highly Influential
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
- Computer Science
- IEEE Trans. Parallel Distributed Syst.
- 2002
- 924
- Highly Influential
- PDF
Internal nodes based broadcasting in wireless networks
- Computer Science
- Proceedings of the 34th Annual Hawaii International Conference on System Sciences
- 2001
- 97
- PDF
Adaptive Clustering for Mobile Wireless Networks
- Computer Science
- IEEE J. Sel. Areas Commun.
- 1997
- 1,724
- PDF
Routing in ad hoc networks using a spine
- Computer Science
- Proceedings of Sixth International Conference on Computer Communications and Networks
- 1997
- 397
- Highly Influential
The clade vertebrata: spines and routing in ad hoc networks
- Computer Science
- Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)
- 1998
- 70
A Greedy Heuristic for the Set-Covering Problem
- Mathematics, Computer Science
- Math. Oper. Res.
- 1979
- 2,437