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

Minimum-latency aggregation schedule (MLAS) in synchronous multihop wireless networks seeks a shortest schedule for data aggregation subject to the interference constraint.Expand

We present a novel localized networking protocol that constructs a planar 2.5-spanner of UDG, called the localized Delaunay triangulation, as network topology.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

We present a novel localized networking protocol that constructs a planar 2 5-spanner of UDG, called the localized Delaunay triangulation (LDEL), as network topology.Expand