Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks

@article{Alzoubi2003WeaklyconnectedDS,
  title={Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks},
  author={Khaled M. Alzoubi and P. Wan and O. Frieder},
  journal={23rd International Conference on Distributed Computing Systems, 2003. Proceedings.},
  year={2003},
  pages={96-104}
}
  • Khaled M. Alzoubi, P. Wan, O. Frieder
  • Published 2003
  • Computer Science
  • 23rd International Conference on Distributed Computing Systems, 2003. Proceedings.
  • 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. The subgraph weakly induced by S is the graph G' = (V, E') such that each edge in E' has at least one end point in S. The 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. In this paper, we present two distributed algorithms for finding a WCDS in O(n) time. The first algorithm has an… CONTINUE READING
    32 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
    Minimum connected dominating sets and maximal independent sets in unit disk graphs
    • 220
    • PDF
    The weakly connected independent set polytope in corona and join of graphs
    • 1
    QoSRT: a Quality of Service Routing Tree for Wireless Ad Hoc Networks
    Maintaining a quality of service routing tree for mobile ad hoc networks
    • 5

    References

    Approximation algorithms for connected dominating
    • sets. Algorithmica,
    • 1998