A PTAS for minimum d-hop connected dominating set in growth-bounded graphs

被引：12

作者：

Gao, Xiaofeng ^{[1
]}

Wang, Wei ^{[2
]}

Zhang, Zhao ^{[3
]}

Zhu, Shiwei ^{[4
]}

Wu, Weili ^{[1
]}

机构：

[1] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75083 USA

[2] Xi An Jiao Tong Univ, Sch Sci, Xian 710049, Peoples R China

[3] Xinjiang Univ, Coll Math & Syst Sci, Xinjiang, Peoples R China

[4] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN USA

来源：

OPTIMIZATION LETTERS | 2010年 / 4卷 / 03期

关键词：

PTAS; Connected dominating set; Growth-bounded graph; WIRELESS NETWORKS; APPROXIMATION SCHEME;

D O I：

10.1007/s11590-009-0148-3

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we design the first polynomial time approximation scheme for d-hop connected dominating set (d-CDS) problem in growth-bounded graphs, which is a general type of graphs including unit disk graph, unit ball graph, etc. Such graphs can represent majority types of existing wireless networks. Our algorithm does not need geometric representation (e. g., specifying the positions of each node in the plane) beforehand. The main strategy is clustering partition. We select the d-CDS for each subset separately, union them together, and then connect the induced graph of this set. We also provide detailed performance and complexity analysis.

引用

页码：321 / 333

页数：13

共 50 条

[21] Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Lenzen, Christoph
Wattenhofer, Roger
DISTRIBUTED COMPUTING, 2010, 6343 : 510 - 524
[22] Adaptive D-Hop Connected Dominating Set in Highly Dynamic Flying Ad-Hoc Networks
Wang, Bowen
Sun, Yanjing
Do-Duy, Tan
Garcia-Palacios, Emiliano
Q. Duong, Trung
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2021, 8 (03): : 2651 - 2664
[23] A Constant Factor Approximation for the d-Hop Connected Dominating Set in Three-Dimensional Wireless Networks
Li, Ke
Gao, Xiaofeng
Wu, Fan
Chen, Guihai
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (09) : 4357 - 4367
[24] An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
Adhya, Amita Samanta
Mondal, Sukumar
Barman, Sambhu Charan
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2021, 14 (04)
[25] 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,
[26] Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor Networks
Nguyen, Trac N.
Huynh, D. T.
2009 IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS (PERCOM), VOLS 1 AND 2, 2009, : 613 - 618
[27] PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks
Du, Hongwei
Ye, Qiang
Zhong, Jioafei
Wang, Yuexuan
Lee, Wonjun
Park, Haesun
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT 1, 2010, 6508 : 252 - +
[28] A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
Zhu, Xu
Wang, Wei
Shan, Shan
Wang, Zhong
Wu, Weili
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 23 (04) : 443 - 450
[29] A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
Xu Zhu
Wei Wang
Shan Shan
Zhong Wang
Weili Wu
Journal of Combinatorial Optimization, 2012, 23 : 443 - 450
[30] A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks
Zhao Zhang
Xiaofeng Gao
Weili Wu
Ding-Zhu Du
Journal of Global Optimization, 2009, 45 : 451 - 458

← 1 2 3 4 5 →