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 条
  • [41] On Independent Transversal Dominating Sets in Graphs
    Sevilleno, Daven S.
    Jamil, Ferdinand P.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2021, 14 (01): : 149 - 163
  • [42] Distributed Dominating Sets in Interval Graphs
    Gorain, Barun
    Mondal, Kaushik
    Pandit, Supantha
    COMPUTING AND COMBINATORICS, COCOON 2022, 2022, 13595 : 508 - 520
  • [43] Constructing distributed connected dominating sets in wireless Ad Hoc and sensor networks
    Zheng C.
    Sun S.-X.
    Huang T.-Y.
    Ruan Jian Xue Bao/Journal of Software, 2011, 22 (05): : 1053 - 1066
  • [44] The maximum number of maximal independent sets in unicyclic connected graphs
    Koh, K. M.
    Goh, C. Y.
    Dong, F. M.
    DISCRETE MATHEMATICS, 2008, 308 (17) : 3761 - 3769
  • [45] An improved distributed algorithm for connected dominating sets in wireless ad hoc networks
    Liu, Hui
    Pan, Yi
    Cao, Jiannong
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3358 : 340 - 351
  • [46] Distributed Algorithms for Edge Dominating Sets
    Suomela, Jukka
    PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, : 365 - 374
  • [47] Distributed Approximation of Capacitated Dominating Sets
    Kuhn, Fabian
    Moscibroda, Thomas
    THEORY OF COMPUTING SYSTEMS, 2010, 47 (04) : 811 - 836
  • [48] An improved distributed algorithm for connected dominating sets in wireless ad hoc networks
    Liu, H
    Pan, Y
    Cao, JN
    PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 2004, 3358 : 340 - 351
  • [49] Optimal Distributed Algorithm for Minimum Connected Dominating Sets in Wireless Sensor Networks
    Raei, H.
    Sarram, M.
    Adibniya, F.
    Tashtarian, F.
    2008 FIFTH IEEE INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS, VOLS 1 AND 2, 2008, : 695 - +
  • [50] Distributed Approximation of Capacitated Dominating Sets
    Fabian Kuhn
    Thomas Moscibroda
    Theory of Computing Systems, 2010, 47 : 811 - 836
12345