An exact algorithm for minimum CDS with shortest path constraint in wireless networks

被引：4

作者：

Ding, Ling ^{[1
]}

Gao, Xiaofeng ^{[1
]}

Wu, Weili ^{[1
]}

Lee, Wonjun ^{[2
]}

Zhu, Xu ^{[3
]}

Du, Ding-Zhu ^{[1
]}

机构：

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

[2] Korea Univ, Dept Comp Sci & Engn, Seoul, South Korea

[3] Xi An Jiao Tong Univ, Dept Math, Xian, Peoples R China

来源：

OPTIMIZATION LETTERS | 2011年 / 5卷 / 02期

基金：

美国国家科学基金会;

关键词：

CDS; Shortest path; Exact algorithm; CONNECTED DOMINATING SETS; UNIT DISK GRAPHS; APPROXIMATION; CONSTRUCTION;

D O I：

10.1007/s11590-010-0208-8

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we study a minimum connected dominating set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pairwise shortest path should be included. Such a minimum CDS (we name this problem as SPCDS) is an important tache of some other algorithms for constructing a minimum CDS. We prove that finding such a minimum SPCDS can be achieved in polynomial time and design an exact algorithm with time complexity O(delta (2) n), where delta is the maximum node degree in communication graph.

引用

页码：297 / 306

页数：10

共 50 条

[41] An exact algorithm for the mean-standard deviation shortest path problem
Khani, Alireza
Boyles, Stephen D.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 81 : 252 - 266
[42] On shortest path routing schemes for wireless ad hoc networks
Dhar, S
Rieck, MQ
Pai, S
HIGH PERFORMANCE COMPUTING - HIPC 2003, 2003, 2913 : 130 - 141
[43] Shortest path planning of a data mule in wireless sensor networks
Yanzhi Hu
Fengbin Zhang
Tian Tian
Dawei Ma
Zhiyong Shi
Wireless Networks, 2022, 28 : 1129 - 1145
[44] Shortest path planning of a data mule in wireless sensor networks
Hu, Yanzhi
Zhang, Fengbin
Tian, Tian
Ma, Dawei
Shi, Zhiyong
WIRELESS NETWORKS, 2022, 28 (03) : 1129 - 1145
[45] Bandwidth Guaranteed Shortest Path Routing in Wireless Mesh Networks
Zeng, Yuanyuan
Xi, Bo
Zeng, Ziming
Wang, Hao
2006 FIRST INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA, 2006,
[46] TIGHT ANALYSIS OF SHORTEST PATH CONVERGECAST IN WIRELESS SENSOR NETWORKS
Augustine, John
Han, Qi
Loden, Philip
Lodha, Sachin
Roy, Sasanka
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (01) : 31 - 50
[47] Online Learning for Shortest Path and Backpressure Routing in Wireless Networks
Amar, Omer
Cohen, Kobi
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2702 - 2707
[48] Shortest conditional decreasing path algorithm for the parametric minimum flow problem
Ciurea, Eleonor
Parpalea, Mircea
BULLETIN MATHEMATIQUE DE LA SOCIETE DES SCIENCES MATHEMATIQUES DE ROUMANIE, 2013, 56 (04): : 387 - 401
[49] Shortest hop multipath algorithm for wireless sensor networks
Yilmaz, Onur
Demirci, Sercan
Kaymak, Yagiz
Ergun, Serkan
Yildirim, Ahmet
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2012, 63 (01) : 48 - 59
[50] New minimum exposure path problem and its solving algorithm in wireless sensor networks
Ye M.
Wang Y.-P.
Dai C.
Wang X.-L.
Tongxin Xuebao/Journal on Communications, 2016, 37 (01):

← 1 2 3 4 5 →