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 条

[21] The restricted shortest-path-based topology control algorithm in wireless multihop networks
Shen, Yao
Cai, Yunze
Li, Xinyan
Xu, Xiaoming
IEEE COMMUNICATIONS LETTERS, 2007, 11 (12) : 937 - 939
[22] A topology maintenance algorithm based on shortest path tree for wireless Ad hoc networks
Shen, Zhong
Chang, Yi-Lin
Cui, Can
Zhang, Xin
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2007, 29 (02): : 323 - 327
[23] An efficient topology maintenance algorithm based on shortest path tree for wireless sensor networks
Shen, Z
Chang, YL
Zhang, X
Cui, C
PDCAT 2005: SIXTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2005, : 288 - 292
[24] Shortest viable path algorithm in multimodal networks
Lozano, A
Storchi, G
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2001, 35 (03) : 225 - 241
[25] An exact algorithm for the robust shortest path problem with interval data
Montemanni, R
Gambardella, LM
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (10) : 1667 - 1680
[26] A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem
Ahmadi, Saman
Tack, Guido
Harabor, Daniel
Kilby, Philip
THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 12217 - 12224
[27] An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints
Lozano, Leonardo
Duque, Daniel
Medaglia, Andres L.
TRANSPORTATION SCIENCE, 2016, 50 (01) : 348 - 357
[28] Path selection algorithm for shortest path bridging in access networks
Nakayama, Yu
Oota, Noriyuki
IEICE COMMUNICATIONS EXPRESS, 2013, 2 (10): : 396 - 401
[29] Performance of multihop wireless networks: Shortest path is not enough
De Couto, DSJ
Aguayo, D
Chambers, BA
Morris, R
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2003, 33 (01) : 83 - 88
[30] Cost Effective ModLeach-A* Search Algorithm for Shortest Path Routing in Wireless Sensor Networks
Nanda, Arabinda
Rath, Amiya Kumar
2016 SIXTH INTERNATIONAL SYMPOSIUM ON EMBEDDED COMPUTING AND SYSTEM DESIGN (ISED 2016), 2016, : 147 - 151

← 1 2 3 4 5 →