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

被引：0
|
作者：
Ling Ding
Xiaofeng Gao
Weili Wu
Wonjun Lee
Xu Zhu
Ding-Zhu Du
机构：
[1] The University of Texas at Dallas,Department of Computer Science
[2] Korea University,Department of Computer Science and Engineering
[3] Xi’an Jiaotong University,Department of Mathematics
来源：
Optimization Letters | 2011年 / 5卷
关键词：
CDS; Shortest path; Exact algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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(δ2n), where δ is the maximum node degree in communication graph.
引用
收藏
页码：297 / 306
页数：9
相关论文
共 50 条
  • [1] An exact algorithm for minimum CDS with shortest path constraint in wireless networks
    Ding, Ling
    Gao, Xiaofeng
    Wu, Weili
    Lee, Wonjun
    Zhu, Xu
    Du, Ding-Zhu
    [J]. OPTIMIZATION LETTERS, 2011, 5 (02) : 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] Minimum-length scheduling with rate control in wireless networks: a shortest path approach
    Pantelidou, Anna
    Ephremides, Anthony
    [J]. EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2011,
12345