Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks

Hongwei Du, Qiang Ye, Jiaofei Zhong, Yuexuan Wang, Wonjun Lee, Haesun Park

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

To reduce routing cost in wireless sensor networks, we study a problem of minimizing the size of connected dominating set D under constraint that for any two nodes u and v, mD(u,v)≤α·m(u,v) where α is a constant, mD(u,v) is the number of intermediate nodes on a shortest path connecting u and v through D and m(u,v) is the number of intermediate nodes in a shortest path between u and v in a given unit disk graph. We show that for α<5, this problem has a polynomial-time approximation scheme, that is, for any ε>0, there is a polynomial-time (1+ε)- approximation.

Original languageEnglish
Pages (from-to)38-43
Number of pages6
JournalTheoretical Computer Science
Volume447
DOIs
Publication statusPublished - 2012 Aug 17

Fingerprint

Connected Dominating Set
Polynomial Time Approximation Scheme
Wireless Sensor Networks
Wireless sensor networks
Routing
Polynomials
Shortest path
Costs
Vertex of a graph
Unit Disk Graph
Polynomial time
Approximation

Keywords

  • Minimum connected dominating set
  • Polynomial-time approximation
  • Routing cost constraint
  • Wireless sensor networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks. / Du, Hongwei; Ye, Qiang; Zhong, Jiaofei; Wang, Yuexuan; Lee, Wonjun; Park, Haesun.

In: Theoretical Computer Science, Vol. 447, 17.08.2012, p. 38-43.

Research output: Contribution to journalArticle

@article{c8365411d2ec4999a80373b38e9e781b,
title = "Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks",
abstract = "To reduce routing cost in wireless sensor networks, we study a problem of minimizing the size of connected dominating set D under constraint that for any two nodes u and v, mD(u,v)≤α·m(u,v) where α is a constant, mD(u,v) is the number of intermediate nodes on a shortest path connecting u and v through D and m(u,v) is the number of intermediate nodes in a shortest path between u and v in a given unit disk graph. We show that for α<5, this problem has a polynomial-time approximation scheme, that is, for any ε>0, there is a polynomial-time (1+ε)- approximation.",
keywords = "Minimum connected dominating set, Polynomial-time approximation, Routing cost constraint, Wireless sensor networks",
author = "Hongwei Du and Qiang Ye and Jiaofei Zhong and Yuexuan Wang and Wonjun Lee and Haesun Park",
year = "2012",
month = "8",
day = "17",
doi = "10.1016/j.tcs.2011.10.010",
language = "English",
volume = "447",
pages = "38--43",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks

AU - Du, Hongwei

AU - Ye, Qiang

AU - Zhong, Jiaofei

AU - Wang, Yuexuan

AU - Lee, Wonjun

AU - Park, Haesun

PY - 2012/8/17

Y1 - 2012/8/17

N2 - To reduce routing cost in wireless sensor networks, we study a problem of minimizing the size of connected dominating set D under constraint that for any two nodes u and v, mD(u,v)≤α·m(u,v) where α is a constant, mD(u,v) is the number of intermediate nodes on a shortest path connecting u and v through D and m(u,v) is the number of intermediate nodes in a shortest path between u and v in a given unit disk graph. We show that for α<5, this problem has a polynomial-time approximation scheme, that is, for any ε>0, there is a polynomial-time (1+ε)- approximation.

AB - To reduce routing cost in wireless sensor networks, we study a problem of minimizing the size of connected dominating set D under constraint that for any two nodes u and v, mD(u,v)≤α·m(u,v) where α is a constant, mD(u,v) is the number of intermediate nodes on a shortest path connecting u and v through D and m(u,v) is the number of intermediate nodes in a shortest path between u and v in a given unit disk graph. We show that for α<5, this problem has a polynomial-time approximation scheme, that is, for any ε>0, there is a polynomial-time (1+ε)- approximation.

KW - Minimum connected dominating set

KW - Polynomial-time approximation

KW - Routing cost constraint

KW - Wireless sensor networks

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

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

U2 - 10.1016/j.tcs.2011.10.010

DO - 10.1016/j.tcs.2011.10.010

M3 - Article

VL - 447

SP - 38

EP - 43

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -