Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2002, Pages 165-172

  Chen, Yuanzhu Peter ^a   Liestman, Arthur L ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Ad hoc network; Clustering; Distributed algorithm; Dominating set; Weakly connected dominating set

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; TELECOMMUNICATION NETWORKS; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

CLUSTERING; DISTRIBUTED ALGORITHM; MOBILE AD HOC NETWORKS; WEAKLY CONNECTED DOMINATING SETS;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 0141639922     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513819.513821     Document Type: Conference Paper

References (18)

1. Baruch Awerbuch, Yi Du, Bilal Khan, and Yuval Shavitt. Routing through networks with hierarchical topology aggregation. In IEEE ISCC'98, pages 406-412, Athens, Greece, June 1998.
2. Dennis Baker, Anthony Ephremides, and Julia A. Flynn. The design and simulation of a mobile radio network with distributed control. IEEE Journal on Selected Areas in Communications, SAC-2(1):226-237, 1984.
3. S. Banerjee and S. Khuller. A clustering scheme for hierarchical routing in wireless networks. Technical Report CS-TR-4103, University of Maryland, College Park, February 2000.
4. B. Basagni. Distributed clustering for ad hoc networks. In Proc. ISPAN'99 Int. Symp. on Parallel Architectures, Algorithms, and Networks, pages 310-315, 1999.
5. C. Bettstetter and R. Krausser. Scenario-based stability analysis of the distributed mobility-adaptive clustering (dmac) algorithm. In Proc. ACM MobiHoc 2001, pages 232-241, 2001.
6. Josh Broch, David A. Maltz, David B. Johnson, Yin-Chun Hu, and Jorjeta Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, ACM, Dallas, TX, October 1998.
7. Geng Chen and Ivan Stojmenovic. Clustering and routing in mobile wireless networks. Technical Report TR-99-05, Site, June 1999.
8. I. Chlamtac and A. Farago. A new approach to the design and analysis of peer-to-peer mobile networks. Wireless Networks, 5:149-156, 1999.
9. Bevan Das and Vaduvur Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In IEEE International Conference on Communications (ICC'97), June 1997.
10. J. E. Dunbar, J.W. Grossman, J.H. Hattingh, S.T. Hedetniemi, and A. A. McRae. On weakly-connected domination in graphs. Discrete Math., 167/168:261-269, 1997.
11. R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning tree. ACM Transactions on Programming Languages and Systems, 5(1):66-77, January 1983.
12. M. L. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.
13. Mario Gerla and Jack Tzu-Chieh Tsai. Multicluster, mobile, multimedia radio network. Wireless Networks, 1:255-265, 1995.
14. Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374-387, 1998.
15. Teresa W. Haynes, Stephen T. Hedetniemi, and Peter J. Slater. Fundamentals of Domination in graphs. Marcel Dekker, Inc., 1998.
16. P. Krishna, N. H. Vaidya, M. Chatterjee, and D. K. Pradhan. A cluster-based approach for routing in dynamic networks. Computer Communication Review, 49:49-64, 1997.
17. Elizabeth M. Royer and Chai-Keong Toh. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications, pages 46-55, 4 1999.
18. Jie Wu and Hailan Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Dial M'99, Seattle, 1999.