A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET

被引：8
|
作者：
Kamei, Sayaka [1 ]
Kakugawa, Hirotsugu [2 ]
机构：
[1] Hiroshima Univ, Dept Informat Engn, Hiroshima 7398527, Japan
[2] Osaka Univ, Dept Comp Sci, Osaka 5608531, Japan
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2010年 / 21卷 / 03期
关键词：
Self-stabilizing algorithm; approximation algorithm; ad hoc network; minimum connected dominating set; fault-tolerant; STEINER TREE; CONSTRUCTION;
D O I：
10.1142/S0129054110007362
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. A self-stabilizing system tolerates any kind and any finite number of transient faults, such as message loss, memory corruption, and topology change. Because such transient faults occur so frequently in mobile ad hoc networks, distributed algorithms on them should tolerate such events. In this paper, we propose a self-stabilizing distributed approximation algorithm for the minimum connected dominating set, which can be used, for example, as a virtual backbone or routing in mobile ad hoc networks. The size of the solution by our algorithm is at most 7.6 vertical bar D-opt vertical bar + 1.4, where D-opt is the minimum connected dominating set. The time complexity is O(k) rounds, where k is the depth of input BFS tree.
引用
收藏
页码：459 / 476
页数：18
相关论文
共 50 条
  • [21] Approximation algorithm for the minimum partial connected Roman dominating set problem
    Zhang, Yaoyao
    Zhang, Zhao
    Du, Ding-Zhu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (04)
  • [22] Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph
    Ding, Yihua
    Wang, James Z.
    Srimani, Pradip K.
    PARALLEL PROCESSING LETTERS, 2015, 25 (04)
  • [23] Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem
    Kobayashi, Hisaki
    Kakugawa, Hirotsugu
    Masuzawa, Toshimitsu
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2017, 2018, 10616 : 378 - 383
  • [24] Optimizing distributed algorithm for minimum connected dominating set with Markov model
    Wang, Wen-Yong
    Xiang, Yu
    Dong, Chuan-Kun
    Yang, Ting
    Tang, Yong
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2010, 38 (10): : 2441 - 2446
  • [25] An effective distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks
    Gao, B
    Yang, YH
    Ma, HY
    FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2004, : 658 - 663
  • [26] A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks
    Gao, B
    Yang, YH
    Ma, HY
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2005, 18 (08) : 743 - 762
  • [27] A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks
    Gao, B
    Ma, HY
    Yang, YH
    PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 2004, 3358 : 352 - 356
  • [28] Performance Evaluation of Distributed Self-Stabilizing Dominating Set Algorithms in Wireless Sensor Networks
    Evcimen, Huseyin Tolga
    Akram, Vahid Khalilpour
    Dagdeviren, Orhan
    2018 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL AND ELECTRONIC ENGINEERING (ICEEE), 2018, : 428 - 432
  • [29] A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
    Datta, Ajoy K.
    Devismes, Stephane
    Larmore, Lawrence L.
    THEORETICAL COMPUTER SCIENCE, 2019, 753 : 35 - 63
  • [30] Greedy approximation for the minimum connected dominating set with labeling
    Zishen Yang
    Majun Shi
    Wei Wang
    Optimization Letters, 2021, 15 : 685 - 700
12345