PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs

Lidong Wu, Hongwei Du, Weili Wu, Yuqing Zhu, Ailan Wang, Wonjun Lee

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Connected dominating set (CDS) has played an important role in building virtual backbone, which is used on unicast, multicast, and fault-tolerant routing in wireless sensor networks. In order to reduce traffic congestion and communication delay, a routing-cost constrained minimum CDS (ROC–CDS) has been studied extensively in the literature. In this paper, we present a PTAS for αROC–CDS where α≥5, that is, there exists a polynomial-time (1+ε)-approximation for minimum CDS under constraint that for every pair of nodes u and v, m<inf>CDS</inf>(u,v)≤m(u,v) where m(u,v) denotes the number of intermediate nodes in the shortest path between u and v, and m<inf>CDS</inf>(u,v) denotes the number of intermediate nodes of the shortest path between u and v through CDS produced by the approximation algorithm.

Original languageEnglish
Pages (from-to)18-26
Number of pages9
JournalJournal of Combinatorial Optimization
Volume30
Issue number1
DOIs
Publication statusPublished - 2015 Jul 28

Fingerprint

Connected Dominating Set
Routing
Traffic congestion
Costs
Approximation algorithms
Graph in graph theory
Shortest path
Wireless sensor networks
Vertex of a graph
Polynomials
Fault-tolerant Routing
Denote
Communication Delay
Traffic Congestion
Communication
Multicast
Backbone
Wireless Sensor Networks
Approximation Algorithms
Polynomial time

Keywords

  • Algorithm PTAS
  • Growth bounded graphs
  • Minimum connected dominating set
  • Routing cost constraint

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics
  • Computational Theory and Mathematics
  • Computer Science Applications
  • Control and Optimization

Cite this

PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs. / Wu, Lidong; Du, Hongwei; Wu, Weili; Zhu, Yuqing; Wang, Ailan; Lee, Wonjun.

In: Journal of Combinatorial Optimization, Vol. 30, No. 1, 28.07.2015, p. 18-26.

Research output: Contribution to journalArticle

Wu, Lidong ; Du, Hongwei ; Wu, Weili ; Zhu, Yuqing ; Wang, Ailan ; Lee, Wonjun. / PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs. In: Journal of Combinatorial Optimization. 2015 ; Vol. 30, No. 1. pp. 18-26.
@article{30545531b95348ce997bc7be9a27f616,
title = "PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs",
abstract = "Connected dominating set (CDS) has played an important role in building virtual backbone, which is used on unicast, multicast, and fault-tolerant routing in wireless sensor networks. In order to reduce traffic congestion and communication delay, a routing-cost constrained minimum CDS (ROC–CDS) has been studied extensively in the literature. In this paper, we present a PTAS for αROC–CDS where α≥5, that is, there exists a polynomial-time (1+ε)-approximation for minimum CDS under constraint that for every pair of nodes u and v, mCDS(u,v)≤m(u,v) where m(u,v) denotes the number of intermediate nodes in the shortest path between u and v, and mCDS(u,v) denotes the number of intermediate nodes of the shortest path between u and v through CDS produced by the approximation algorithm.",
keywords = "Algorithm PTAS, Growth bounded graphs, Minimum connected dominating set, Routing cost constraint",
author = "Lidong Wu and Hongwei Du and Weili Wu and Yuqing Zhu and Ailan Wang and Wonjun Lee",
year = "2015",
month = "7",
day = "28",
doi = "10.1007/s10878-013-9626-8",
language = "English",
volume = "30",
pages = "18--26",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs

AU - Wu, Lidong

AU - Du, Hongwei

AU - Wu, Weili

AU - Zhu, Yuqing

AU - Wang, Ailan

AU - Lee, Wonjun

PY - 2015/7/28

Y1 - 2015/7/28

N2 - Connected dominating set (CDS) has played an important role in building virtual backbone, which is used on unicast, multicast, and fault-tolerant routing in wireless sensor networks. In order to reduce traffic congestion and communication delay, a routing-cost constrained minimum CDS (ROC–CDS) has been studied extensively in the literature. In this paper, we present a PTAS for αROC–CDS where α≥5, that is, there exists a polynomial-time (1+ε)-approximation for minimum CDS under constraint that for every pair of nodes u and v, mCDS(u,v)≤m(u,v) where m(u,v) denotes the number of intermediate nodes in the shortest path between u and v, and mCDS(u,v) denotes the number of intermediate nodes of the shortest path between u and v through CDS produced by the approximation algorithm.

AB - Connected dominating set (CDS) has played an important role in building virtual backbone, which is used on unicast, multicast, and fault-tolerant routing in wireless sensor networks. In order to reduce traffic congestion and communication delay, a routing-cost constrained minimum CDS (ROC–CDS) has been studied extensively in the literature. In this paper, we present a PTAS for αROC–CDS where α≥5, that is, there exists a polynomial-time (1+ε)-approximation for minimum CDS under constraint that for every pair of nodes u and v, mCDS(u,v)≤m(u,v) where m(u,v) denotes the number of intermediate nodes in the shortest path between u and v, and mCDS(u,v) denotes the number of intermediate nodes of the shortest path between u and v through CDS produced by the approximation algorithm.

KW - Algorithm PTAS

KW - Growth bounded graphs

KW - Minimum connected dominating set

KW - Routing cost constraint

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

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

U2 - 10.1007/s10878-013-9626-8

DO - 10.1007/s10878-013-9626-8

M3 - Article

VL - 30

SP - 18

EP - 26

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 1

ER -