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 条
  • [1] Construction of distributed connected dominating sets in growth-bounded graphs
    Qian, Jiansheng
    Sun, Yanjing
    ICIEA 2008: 3RD IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, PROCEEDINGS, VOLS 1-3, 2008, : 1430 - 1434
  • [2] Distributed Algorithm of Connected Dominating Sets Based on Energy Balance
    Dan, Zou
    PROCEEDINGS OF THE 2017 2ND INTERNATIONAL CONFERENCE ON AUTOMATION, MECHANICAL CONTROL AND COMPUTATIONAL ENGINEERING (AMCCE 2017), 2017, 118 : 985 - 989
  • [3] Dominating Sets and Connected Dominating Sets in Dynamic Graphs
    Hjuler, Niklas
    Italiano, Giuseppe F.
    Parotsidis, Nikos
    Saulpic, David
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [4] Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
    Ding, Ling
    Gao, Xiaofeng
    Wu, Weili
    Lee, Wonjun
    Zhu, Xu
    Du, Ding-Zhu
    2010 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS ICDCS 2010, 2010,
  • [5] Minimum connected dominating sets and maximal independent sets in unit disk graphs
    Wu, WL
    Du, HW
    Jia, XH
    Li, YS
    Huang, SCH
    THEORETICAL COMPUTER SCIENCE, 2006, 352 (1-3) : 1 - 7
  • [6] Dominating Sets and Independent Sets in a Tree
    Jou, Min-Jen
    ARS COMBINATORIA, 2010, 96 : 499 - 503
  • [7] On greedy construction of connected dominating sets in wireless networks
    Li, YS
    Thai, MT
    Wang, F
    Yi, CW
    Wan, PJ
    Du, DZ
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2005, 5 (08): : 927 - 932
  • [8] On dominating sets and independent sets of graphs
    Harant, J
    Pruchnewski, A
    Voigt, M
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 547 - 553
  • [9] Distributed Construction of d-hop Connected Dominating Sets for Wireless Sensor Networks
    Skiadopoulos, Konstantinos
    Giannakis, Konstantinos
    Oikonomou, Konstantinos
    Stavrakakis, Ioannis
    Aissa, Sonia
    2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
  • [10] On the maximum number of maximum independent sets in connected graphs
    Mohr, Elena
    Rautenbach, Dieter
    JOURNAL OF GRAPH THEORY, 2021, 96 (04) : 510 - 521
12345