TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET

被引：22
|
作者：
Zhang, Zhao [1 ]
Liu, Qinghai [1 ]
Li, Deying [2 ]
机构：
[1] Xinjiang Univ, Coll Math & Syst Sci, Xinjiang 830046, Peoples R China
[2] Renmin Univ China, Sch Informat, Beijing 100872, Peoples R China
来源：
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2009年 / 1卷 / 04期
关键词：
Wireless sensor network; connected dominating set; independent set; greedy algorithm;
D O I：
10.1142/S1793830909000361
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A vertex set D of a connected graph G is a (k, r)-connected dominating set ((k, r)-CDS) if every vertex in V (G)\D is at most r-hops away from at least k vertices in D. Finding a minimum (k, r)-CDS has wireless sensor network as its background. In this paper, we give two approximation algorithms to compute a minimum (k, r)-CDS, which improves previous works in regard of performance ratio.
引用
收藏
页码：485 / 498
页数：14
相关论文
共 50 条
  • [1] MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
    Li, Deying
    Liu, Lin
    Yang, Huiqiang
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (01) : 45 - 57
  • [2] Two algorithms for minimum 2-connected r-hop dominating set
    Li, Xiuying
    Zhang, Zhao
    INFORMATION PROCESSING LETTERS, 2010, 110 (22) : 986 - 991
  • [3] On the Construction of Load-Balanced (k, r-hop)Connected Dominating Set for WSNs
    Moulahi, Tarek
    Guyennet, Herve
    Nasri, Salem
    Hajlaoui, Rjab
    2012 IEEE INTERNATIONAL CONFERENCE ON ADVANCED NETWORKS AND TELECOMMUNCATIONS SYSTEMS (ANTS), 2012, : 76 - 80
  • [4] Algorithms for minimum m-connected k-dominating set problem
    Shang, Weiping
    Yao, Frances
    Wan, Pengjun
    Hu, Xiaodong
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2007, 4616 : 182 - +
  • [5] Connected k-dominating graphs
    Mynhardt, C. M.
    Teshima, L. E.
    Roux, A.
    DISCRETE MATHEMATICS, 2019, 342 (01) : 145 - 151
  • [6] On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
    Dai, Fei
    Wu, Jie
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2006, 66 (07) : 947 - 958
  • [7] On minimum m-connected k-dominating set problem in unit disc graphs
    Weiping Shang
    Frances Yao
    Pengjun Wan
    Xiaodong Hu
    Journal of Combinatorial Optimization, 2008, 16 : 99 - 106
  • [8] On minimum m-connected k-dominating set problem in unit disc graphs
    Shang, Weiping
    Yao, Frances
    Wan, Pengjun
    Hu, Xiaodong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2008, 16 (02) : 99 - 106
  • [9] The k-hop connected dominating set problem: approximation and hardness
    Coelho, Rafael S.
    Moura, Phablo F. S.
    Wakabayashi, Yoshiko
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (04) : 1060 - 1083
  • [10] The k-hop connected dominating set problem: approximation and hardness
    Rafael S. Coelho
    Phablo F. S. Moura
    Yoshiko Wakabayashi
    Journal of Combinatorial Optimization, 2017, 34 : 1060 - 1083
12345