A maximal independent set (MIS) S for a graph G is an independent set and no proper superset of S is also independent. A set S is dominating if each node in the graph is either in S or adjacent to one of the nodes in S. The subgraph weakly induced by S is the graph G′ such that each edge in G′ has at least one end point in S. A set S is a weakly-connected dominating set (WCDS) of G if S is dominating and G′ is connected. G′ is a sparse spanner if it has linear edges. The nodes of WCDS have been proposed in the literature as clusterheads for clustered wireless ad hoc networks. In this paper, we present two distributed algorithms for constructing a WCDS for wireless ad hoc networks in linear time. The first algorithm has an approximation ratio of 5, and requires O(n log n) messages, while the second algorithm has a larger approximation ratio, and requires only O(n) messages. Both of these algorithms are used to obtain sparse spanners. The spanner obtained by the second algorithm has a topological dilation of 3, and a geometric dilation of 6. Both of these algorithms are based on the construction of a MIS. The first algorithm requires the construction of a spanning tree. The second algorithm is fully localized, and does not depend on the spanning tree, which makes the maintenance of the WCDS simpler, and guarantees the maintenance of the same approximation ratio.
Multicast Overlay Spanning Tree Protocol for Ad Hoc Networks
