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

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)297-306
Number of pages10
JournalOptimization Letters
Volume5
Issue number2
DOIs
Publication statusPublished - 2011 May 1

Fingerprint

Connected Dominating Set
Exact Algorithms
Shortest path
Wireless Networks
Vertex of a graph
Time Complexity
Pairwise
Polynomial time
Graph in graph theory

Keywords

  • CDS
  • Exact algorithm
  • Shortest path

ASJC Scopus subject areas

  • Control and Optimization

Cite this

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.

In: Optimization Letters, Vol. 5, No. 2, 01.05.2011, p. 297-306.

Research output: Contribution to journalArticle

Ding, Ling ; Gao, Xiaofeng ; Wu, Weili ; Lee, Wonjun ; Zhu, Xu ; Du, Ding Zhu. / An exact algorithm for minimum CDS with shortest path constraint in wireless networks. In: Optimization Letters. 2011 ; Vol. 5, No. 2. pp. 297-306.
@article{b13f666d1efa4a45a5b7ec3b8d255db3,
title = "An exact algorithm for minimum CDS with shortest path constraint in wireless networks",
abstract = "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.",
keywords = "CDS, Exact algorithm, Shortest path",
author = "Ling Ding and Xiaofeng Gao and Weili Wu and Wonjun Lee and Xu Zhu and Du, {Ding Zhu}",
year = "2011",
month = "5",
day = "1",
doi = "10.1007/s11590-010-0208-8",
language = "English",
volume = "5",
pages = "297--306",
journal = "Optimization Letters",
issn = "1862-4472",
publisher = "Springer Verlag",
number = "2",

}

TY - JOUR

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

AU - Ding, Ling

AU - Gao, Xiaofeng

AU - Wu, Weili

AU - Lee, Wonjun

AU - Zhu, Xu

AU - Du, Ding Zhu

PY - 2011/5/1

Y1 - 2011/5/1

N2 - 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.

AB - 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.

KW - CDS

KW - Exact algorithm

KW - Shortest path

UR - http://www.scopus.com/inward/record.url?scp=79952902539&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952902539&partnerID=8YFLogxK

U2 - 10.1007/s11590-010-0208-8

DO - 10.1007/s11590-010-0208-8

M3 - Article

AN - SCOPUS:79952902539

VL - 5

SP - 297

EP - 306

JO - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

IS - 2

ER -