Message-optimal connected dominating sets in mobile ad hoc networks

@inproceedings{Alzoubi2002MessageoptimalCD,
  title={Message-optimal connected dominating sets in mobile ad hoc networks},
  author={Khaled M. Alzoubi and P. Wan and O. Frieder},
  booktitle={MobiHoc '02},
  year={2002}
}
  • Khaled M. Alzoubi, P. Wan, O. Frieder
  • Published in MobiHoc '02 2002
  • Computer Science
  • 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 node in V1, and V1 induces a connected subgraph. A CDS has been proposed as a virtual backbone for routing in wireless ad hoc networks. However, it is NP-hard to find a minimum connected dominating set (MCDS). Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a very poor approximation ratio, and from high time… CONTINUE READING
    415 Citations
    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 Computers and Communications. ISCC 2003
    • 2003
    • 17
    A Distributed Algorithm for Connecting Dominating Sets in Wireless Ad Hoc Networks
    • 3
    Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks
    • 7
    A distributed greedy algorithm for construction of minimum connected dominating set in wireless sensor network
    • 6
    A distributed algorithm for computing Connected Dominating Set in ad hoc networks
    • 5
    • Highly Influenced
    Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
    • 166
    • PDF
    On greedy construction of connected dominating sets in wireless networks
    • 185
    • PDF