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 条

[31] A constrained shortest-path energy-aware routing algorithm for wireless sensor networks
Youssef, MA
Younis, MF
Arisha, KA
WCNC 2002: IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE RECORD, VOLS 1 & 2, 2002, : 794 - 799
[32] Modification of Floyd-Warshall's Algorithm for Shortest Path Routing in Wireless Sensor Networks
Khan, Pritam
Konar, Gargi
Chakraborty, Niladri
2014 Annual IEEE India Conference (INDICON), 2014,
[33] Modification of Floyd-Warshall's Algorithm for Shortest Path Routing in Wireless Sensor Networks
Khan, Pritam
Konar, Gargi
Chakraborty, Niladri
2014 Annual IEEE India Conference (INDICON), 2014,
[34] STRING ALGORITHM FOR SHORTEST-PATH IN DIRECTED NETWORKS
KLEE, V
OPERATIONS RESEARCH, 1964, 12 (03) : 428 - &
[35] An Algorithm to Find the kth shortest Path in Halin Networks
Lu, Yunting
Li, Zhenjun
2008 INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION WORKSHOP: IITA 2008 WORKSHOPS, PROCEEDINGS, 2008, : 698 - +
[36] Modified Dijkstra Shortest Path Algorithm for SD Networks
Abdelghany, Haitham M.
Zaki, Fayez W.
Ashour, Mohammed M.
INTERNATIONAL JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING SYSTEMS, 2022, 13 (03) : 203 - 208
[37] Approximation Algorithm for Shortest Path in Large Social Networks
Mensah, Dennis Nii Ayeh
Gao, Hui
Yang, Liang Wei
ALGORITHMS, 2020, 13 (02)
[38] An Approximation Algorithm for Shortest Path Based on the Hierarchical Networks
Ayeh, Mensah Dennis Nii
Gao, Hui
Chen, Duanbing
INFORMATION AND COMMUNICATION TECHNOLOGY FOR INTELLIGENT SYSTEMS (ICTIS 2017) - VOL 2, 2018, 84 : 461 - 472
[39] Genetic Algorithm for Shortest Path in Ad Hoc Networks
Khankhour, Hala
Abouchabaka, Jaafar
Abdoun, Otman
ADVANCED INTELLIGENT SYSTEMS FOR SUSTAINABLE DEVELOPMENT, AI2SD'2019, VOL 6: ADVANCED INTELLIGENT SYSTEMS FOR NETWORKS AND SYSTEMS, 2020, 92 : 145 - 154
[40] An Amoeboid Algorithm for Shortest Path in Fuzzy Weighted Networks
Zhang, Yajuan
Zhang, Zili
Zhang, Xiaoge
Wei, Daijun
Deng, Yong
PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 3709 - 3713

← 1 2 3 4 5 →