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

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 [14] 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. Categories and Subject Descript...

• Type: Conference
• Year: 2002
• Where: MOBIHOC
• Authors: Yuanzhu Peter Chen, Arthur L. Liestman
• Keywords: Ad Hoc Networks, Centralized Approximation Algorithms, Connected Dominating Sets, MOBIHOC 2002, Wireless Networks