Yuanzhu Peter Chen
ABSTRACT
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The structure of a graph can be simplified using WCDS's and made more succinct for routing in ad hoc networks. The theoretical performance ratio of these algorithms is O(ln Δ) compared to the minimum size WCDS, where Δ is the maximum degree of the input graph. The first two algorithms are based on the centralized approximation algorithms of Guha and Khuller cite guha-khuller-1998 for finding small connected dominating sets (CDS's). The main contribution of this work is a completely distributed algorithm for finding small WCDS's and the performance of this algorithm is shown to be very close to that of the centralized approach. Comparisons between our work and some previous work (CDS-based) are also given in terms of the size of resultant dominating sets and graph connectivity degradation.
- 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. Google Scholar
Digital Library
- 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.Google ScholarDigital Library
- 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.Google Scholar
- B. Basagni. Distributed clustering for ad hoc networks. In Proc. ISPAN'99 Int. Symp. on Parallel Architectures, Algorithms, and Networks, pages 310--315, 1999. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Josh Broch, David A. Maltz, David B. Johnson, Yih-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. Google ScholarDigital Library
- Geng Chen and Ivan Stojmenovic. Clustering and routing in mobile wireless networks. Technical Report TR-99-05, SITE, June 1999.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- M. L. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979. Google ScholarDigital Library
- Mario Gerla and Jack Tzu-Chieh Tsai. Multicluster, mobile, multimedia radio network. Wireless Networks, 1:255--265, 1995. Google ScholarDigital Library
- Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374--387, 1998. Google ScholarDigital Library
- Teresa W. Haynes, Stephen T. Hedetniemi, and Peter J. Slater. Fundamentals of Domination in graphs. Marcel Dekker, Inc., 1998.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google Scholar
- Jie Wu and Hailan Li. On calculating connected dominating set for efficient routing in adGoogle Scholar
Index Terms
- Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Recommendations
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports self-configuration and self-management. Efficient clustering protocol for constructing virtual backbone is becoming one of the ...
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the ...
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
Motivated by cooperative communication in ad hoc networks, Wu et al. proposed extended dominating set (EDS) where each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors, and defined two types of ...
Comments