We establish a (n logn) lower bound on message complexity of any distributed algorithm for nontrivial CDS and present an algorithm that outperforms the existing algorithms.Expand

A connected dominating set (CDS) for a graph G(V,E) is a subset V1 of V, such that each node in V--V1 is adjacent to some nodes in V1, and V1 induces a connected subgraph.Expand

A connected dominating set (CDS) for a graph G(V, E) is a subset V' of V, such that each node in V is adjacent to some node in E, and V' induces a connected subgraph.Expand

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… Expand

We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner with bounded communication costs.Expand

We present a new algorithm for constructing and maintaining a CDS-based sparse spanner for mobile ad hoc networks without using geographic positions.Expand

A set S is dominating if each node in the graph G = (V, E) is either in S or adjacent to at least one of the nodes in S, and G' is a sparse spanner if it has linear edges.Expand