Distributed construction of connected dominating sets based on maximum independent sets

被引：0
|
作者：
Collage of Information and Communication Engineering, Harbin Engineering University, Harbin, China [1 ]
不详 [2 ]
机构：
来源：
Sensors Transducers | 2013年 / 12卷 / 383-387期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Constructing connected dominating sets (CDS) plays an important role in improving broadcast efficiency, simplifying routing and avoiding collision for wireless ad hoc networks. In this paper, a distributed algorithm called DCDS for constructing CDS based on maximum independent sets (MIS) was put forward. In this algorithm, each node only needs to know its 2-hop neighbors rather than all nodes in network. DCDS algorithm consists of three steps including neighbor discovery, MIS construction and MIS interconnection. The theoretical analysis showed that the message complexity of DCDS was O(n), the time complexity was O(Δ) at most, and the approximation factor was 8. Simulation result confirmed the validity of DCDS algorithm. © 2013 IFSA.
引用
收藏
相关论文
共 50 条
  • [21] Energy Efficient Routing based on Connected Dominating Sets
    Massad, Y.
    Villadangos, J.
    Cholvi, V.
    2012 11TH IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA), 2012, : 101 - 104
  • [22] Distributed Algorithms for Multi-Layer Connected Edge Dominating Sets
    Papakostas, Dimitrios
    Eshghi, Soheil
    Katsaros, Dimitrios
    Tassiulas, Leandros
    IEEE CONTROL SYSTEMS LETTERS, 2019, 3 (01): : 31 - 36
  • [23] Distributed heuristics for connected dominating sets in wireless ad hoc networks
    Alzoubi, KM
    Wan, PJ
    Frieder, O
    JOURNAL OF COMMUNICATIONS AND NETWORKS, 2002, 4 (01) : 22 - 29
  • [24] Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
    Islam, Kamrul
    Akl, Selim G.
    Meijer, Henk
    DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, PROCEEDINGS, 2009, 5516 : 343 - 355
  • [25] Approximation Algorithms for Connected Dominating Sets
    S. Guha
    S. Khuller
    Algorithmica, 2007, 49 : 79 - 79
  • [26] On connected dominating sets of restricted diameter
    Buchanan, Austin
    Sung, Je Sang
    Boginski, Vladimir
    Butenko, Sergiy
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (02) : 410 - 418
  • [27] An Improved Greedy Construction of Minimum Connected Dominating Sets in Wireless Networks
    Das, Ariyam
    Mandal, Chittaranjan
    Reade, Chris
    Aasawat, Manish
    2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2011, : 790 - 795
  • [28] An improved energy Minimum Connected Dominating Sets Construction Algorithm in MANET
    Yang, Zifen
    Li, Guoqiang
    Liu, Li
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ADVANCES IN MECHANICAL ENGINEERING AND INDUSTRIAL INFORMATICS, 2015, 15 : 1041 - 1046
  • [29] Construction of strongly connected dominating sets in asymmetric multihop wireless networks
    Li, Deying
    Du, Hongwei
    Wan, Peng-Jun
    Gao, Xiaofeng
    Zhang, Zhao
    Wu, Weili
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 661 - 669
  • [30] Approximation Algorithms for Connected Dominating Sets
    S. Guha
    S. Khuller
    Algorithmica, 1998, 20 : 374 - 387
12345