New distributed algorithm for connected dominating set in wireless ad hoc networks

@article{Alzoubi2002NewDA,
  title={New distributed algorithm for connected dominating set in wireless ad hoc networks},
  author={Khaled M. Alzoubi and P. Wan and O. Frieder},
  journal={Proceedings of the 35th Annual Hawaii International Conference on System Sciences},
  year={2002},
  pages={3849-3855}
}
  • Khaled M. Alzoubi, P. Wan, O. Frieder
  • Published 2002
  • Computer Science
  • Proceedings of the 35th Annual Hawaii International Conference on System Sciences
  • 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 minimum CDS. We first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms can not guarantee to generate a CDs of small size. Their message complexities can be as high as O(n/sup 2/), and their time complexities may also be as large as O(n/sup… CONTINUE READING
    339 Citations

    Figures, Tables, and Topics from this paper

    Distributed algorithms for connected domination in wireless networks
    • 31
    • PDF
    Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks
    • 43
    • Highly Influenced
    Distributed Construction of Weakly Connected Dominating Sets for Clustering Mobile Ad Hoc Networks
    • F. Mtenzi
    • Computer Science
    • J. Digit. Inf. Manag.
    • 2005
    • PDF
    Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
    • 52
    • Highly Influenced
    • PDF
    Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
    • 180
    • 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
    Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
    • 166
    • PDF

    References

    SHOWING 1-10 OF 16 REFERENCES
    Routing in ad-hoc networks using minimum connected dominating sets
    • B. Das, V. Bharghavan
    • Computer Science
    • Proceedings of ICC'97 - International Conference on Communications
    • 1997
    • 866
    • Highly Influential
    Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
    • 924
    • Highly Influential
    • PDF
    Internal nodes based broadcasting in wireless networks
    • 97
    • PDF
    Adaptive Clustering for Mobile Wireless Networks
    • 1,724
    • PDF
    Multicluster, mobile, multimedia radio network
    • 1,611
    • PDF
    Propagation and Leader Election in a Multihop Broadcast Environment
    • 98
    • PDF
    Routing in ad hoc networks using a spine
    • 397
    • Highly Influential
    The clade vertebrata: spines and routing in ad hoc networks
    • 70
    Unit disk graphs
    • 1,409
    A Greedy Heuristic for the Set-Covering Problem
    • V. Chvátal
    • Mathematics, Computer Science
    • Math. Oper. Res.
    • 1979
    • 2,437