PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

To reduce routing cost and to improve road load balance, we study a problem of minimizing size of connected dominating set D under constraint that for any two nodes u and v, the routing cost through D is within a factor of α from the minimum, the cost of the shortest path between u and v. We show that for α ≥ 5, this problem in unit disk graphs has a polynomial-time approximation scheme, that is, for any ε > 0, there is a polynomial-time (1 + ε)-approximation.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages252-259
Number of pages8
Volume6508 LNCS
EditionPART 1
DOIs
Publication statusPublished - 2010 Dec 1
Event4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 - Kailua-Kona, HI, United States
Duration: 2010 Dec 182010 Dec 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6508 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010
CountryUnited States
CityKailua-Kona, HI
Period10/12/1810/12/20

Fingerprint

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Du, H., Ye, Q., Zhong, J., Wang, Y., Lee, W., & Park, H. (2010). PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 1 ed., Vol. 6508 LNCS, pp. 252-259). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6508 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-17458-2_21

PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks. / Du, Hongwei; Ye, Qiang; Zhong, Jioafei; Wang, Yuexuan; Lee, Wonjun; Park, Haesun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6508 LNCS PART 1. ed. 2010. p. 252-259 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6508 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Du, H, Ye, Q, Zhong, J, Wang, Y, Lee, W & Park, H 2010, PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 edn, vol. 6508 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6508 LNCS, pp. 252-259, 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010, Kailua-Kona, HI, United States, 10/12/18. https://doi.org/10.1007/978-3-642-17458-2_21
Du H, Ye Q, Zhong J, Wang Y, Lee W, Park H. PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 ed. Vol. 6508 LNCS. 2010. p. 252-259. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). https://doi.org/10.1007/978-3-642-17458-2_21
Du, Hongwei ; Ye, Qiang ; Zhong, Jioafei ; Wang, Yuexuan ; Lee, Wonjun ; Park, Haesun. / PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6508 LNCS PART 1. ed. 2010. pp. 252-259 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
@inproceedings{b9ada428efd544a0af3760f05b236b23,
title = "PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks",
abstract = "To reduce routing cost and to improve road load balance, we study a problem of minimizing size of connected dominating set D under constraint that for any two nodes u and v, the routing cost through D is within a factor of α from the minimum, the cost of the shortest path between u and v. We show that for α ≥ 5, this problem in unit disk graphs has a polynomial-time approximation scheme, that is, for any ε > 0, there is a polynomial-time (1 + ε)-approximation.",
author = "Hongwei Du and Qiang Ye and Jioafei Zhong and Yuexuan Wang and Wonjun Lee and Haesun Park",
year = "2010",
month = "12",
day = "1",
doi = "10.1007/978-3-642-17458-2_21",
language = "English",
isbn = "3642174574",
volume = "6508 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "252--259",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 1",

}

TY - GEN

T1 - PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks

AU - Du, Hongwei

AU - Ye, Qiang

AU - Zhong, Jioafei

AU - Wang, Yuexuan

AU - Lee, Wonjun

AU - Park, Haesun

PY - 2010/12/1

Y1 - 2010/12/1

N2 - To reduce routing cost and to improve road load balance, we study a problem of minimizing size of connected dominating set D under constraint that for any two nodes u and v, the routing cost through D is within a factor of α from the minimum, the cost of the shortest path between u and v. We show that for α ≥ 5, this problem in unit disk graphs has a polynomial-time approximation scheme, that is, for any ε > 0, there is a polynomial-time (1 + ε)-approximation.

AB - To reduce routing cost and to improve road load balance, we study a problem of minimizing size of connected dominating set D under constraint that for any two nodes u and v, the routing cost through D is within a factor of α from the minimum, the cost of the shortest path between u and v. We show that for α ≥ 5, this problem in unit disk graphs has a polynomial-time approximation scheme, that is, for any ε > 0, there is a polynomial-time (1 + ε)-approximation.

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

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

U2 - 10.1007/978-3-642-17458-2_21

DO - 10.1007/978-3-642-17458-2_21

M3 - Conference contribution

SN - 3642174574

SN - 9783642174575

VL - 6508 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 252

EP - 259

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -