• Publications
  • Influence
Distributed construction of connected dominating set in wireless ad hoc networks
TLDR
We present our own distributed algorithm that always outputs a nontrivial CDS. Expand
  • 869
  • 86
  • PDF
New distributed algorithm for connected dominating set in wireless ad hoc networks
TLDR
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
  • 338
  • 40
  • PDF
Message-optimal connected dominating sets in mobile ad hoc networks
TLDR
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
  • 414
  • 33
  • PDF
Distributed heuristics for connected dominating sets in wireless ad hoc networks
TLDR
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
  • 255
  • 24
  • PDF
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
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 minimumExpand
  • 256
  • 15
Geometric Spanners for Wireless Ad Hoc Networks
TLDR
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
  • 97
  • 6
Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks
  • Khaled M. Alzoubi
  • Computer Science
  • Proceedings of the Eighth IEEE Symposium on…
  • 30 June 2003
TLDR
We present a new algorithm for constructing and maintaining a CDS-based sparse spanner for mobile ad hoc networks without using geographic positions. Expand
  • 17
  • 4
Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks
TLDR
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
  • 32
  • 1
  • PDF
Virtual Backbone in Wireless Ad Hoc Networks
  • 15
  • 1
A Simple Heuristic for Minimum Connected Dominating Set in Graphs
TLDR
In this paper , we present a simple heuristic for Minimum Connected Dominating Set in graphs. Expand
  • 21
  • 1