Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks

@article{Alzoubi2003ConnectedDS,
  title={Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks},
  author={Khaled M. Alzoubi},
  journal={Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003},
  year={2003},
  pages={209-216 vol.1}
}
  • Khaled M. Alzoubi
  • Published 2003
  • Computer Science
  • Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003
  • A set S is a dominating set (DS) if each node in the graph is either in S or a neighbor to at least one of the nodes in S. A connected dominating set (CDS) is a DS that induces a connected subgraph. A t-spanner of a graph G = (V,E) is a spanning subgraph G' = (V,E'), such that the shortest hop path between any two nodes in G', is at most t times their shortest path in G. A sparse spanner (spanner with linear edges) is of fundamental importance to distributed networking operations. In this paper… CONTINUE READING
    17 Citations
    Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks
    • 43
    • Highly Influenced
    A simple improved distributed algorithm for minimum CDS in unit disk graphs
    • S. Funke, A. Kesselman, U. Meyer, M. Segal
    • Computer Science, Mathematics
    • WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005.
    • 2005
    • 167
    • PDF
    A simple improved distributed algorithm for minimum CDS in unit disk graphs
    • 7
    • PDF
    A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs
    • 28
    • PDF
    Maintaining a quality of service routing tree for mobile ad hoc networks
    • 5
    QoSRT: a Quality of Service Routing Tree for Wireless Ad Hoc Networks
    Quality of Service Routing Tree for Wireless Ad Hoc Networks
    Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
    • 52
    • Highly Influenced
    • PDF
    Distributed algorithms for connected domination in wireless networks
    • 31
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 21 REFERENCES
    Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks
    • 32
    • PDF
    Message-optimal connected dominating sets in mobile ad hoc networks
    • 415
    • PDF
    Distributed heuristics for connected dominating sets in wireless ad hoc networks
    • 258
    • PDF
    Distributed construction of a planar spanner and routing for ad hoc wireless networks
    • X. Li, G. Calinescu, P. Wan
    • Computer Science
    • Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
    • 2002
    • 308
    • PDF
    Power efficient and sparse spanner for wireless ad hoc networks
    • X. Li, P. Wan, Yu Wang
    • Computer Science
    • Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495)
    • 2001
    • 190
    • PDF
    New distributed algorithm for connected dominating set in wireless ad hoc networks
    • 338
    • PDF
    Distributed construction of connected dominating set in wireless ad hoc networks
    • 881
    • PDF
    Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
    • 924
    • Highly Influential
    • PDF