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 条

[1] An exact algorithm for minimum CDS with shortest path constraint in wireless networks
Ling Ding
Xiaofeng Gao
Weili Wu
Wonjun Lee
Xu Zhu
Ding-Zhu Du
[J]. Optimization Letters, 2011, 5 : 297 - 306
[2] A new algorithm of computing shortest path on wireless networks
He, Hong
Yuan, Shengzhong
Lin, Zongkai
[J]. 2006 1ST INTERNATIONAL SYMPOSIUM ON PERVASIVE COMPUTING AND APPLICATIONS, PROCEEDINGS, 2006, : 705 - +
[3] Clustering Algorithm in wireless sensor networks based on shortest path
El Khediri, Salim
Thaljaoui, Adel
Dallali, Adel
Kachouri, Abdennaceur
[J]. 2018 30TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS (ICM), 2018, : 335 - 338
[4] Constraint shortest path first algorithm in ASON
Jianping Wang
Wenyi Li
Xiayan Zhang
[J]. IC-BNMT 2007: Proceedings of 2007 International Conference on Broadband Network & Multimedia Technology, 2007, : 268 - 273
[5] A novel connectivity algorithm based on shortest path for wireless sensor networks
El Khediri, Salim
Thaljaoui, Adel
Dallali, Adel
Harakti, Souli
Kachouri, Abdennaceur
[J]. 2018 1ST INTERNATIONAL CONFERENCE ON COMPUTER APPLICATIONS & INFORMATION SECURITY (ICCAIS' 2018), 2018,
[6] Planning wireless networks by shortest path
Mannino, C.
Mattia, S.
Sassano, A.
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2011, 48 (03) : 533 - 551
[7] Planning wireless networks by shortest path
C. Mannino
S. Mattia
A. Sassano
[J]. Computational Optimization and Applications, 2011, 48 : 533 - 551
[8] An exact algorithm for the statistical shortest path problem*
Deng, Liang
Wong, Martin D. F.
[J]. ASP-DAC 2006: 11TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, PROCEEDINGS, 2006, : 965 - 970
[9] Minimum-length scheduling with rate control in wireless networks: a shortest path approach
Anna Pantelidou
Anthony Ephremides
[J]. EURASIP Journal on Wireless Communications and Networking, 2011
[10] Multicast routing in wireless mesh networks: Minimum cost trees or shortest path trees?
Nguyen, Uyen Trang
Xu, Jin
[J]. IEEE COMMUNICATIONS MAGAZINE, 2007, 45 (11) : 72 - 77

← 1 2 3 4 5 →