Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Du, Hongwei | - |
dc.contributor.author | Ye, Qiang | - |
dc.contributor.author | Zhong, Jiaofei | - |
dc.contributor.author | Wang, Yuexuan | - |
dc.contributor.author | Lee, Wonjun | - |
dc.contributor.author | Park, Haesun | - |
dc.date.accessioned | 2021-09-06T16:30:15Z | - |
dc.date.available | 2021-09-06T16:30:15Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2012-08-17 | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/107690 | - |
dc.description.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, m(D)(u, v) <= alpha.m(u, v) where alpha is a constant, m(D)(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 alpha >= 5, this problem has a polynomial-time approximation scheme, that is, for any epsilon > 0, there is a polynomial-time (1 + epsilon)-approximation. (c) 2011 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Wonjun | - |
dc.identifier.doi | 10.1016/j.tcs.2011.10.010 | - |
dc.identifier.wosid | 000306726600005 | - |
dc.identifier.bibliographicCitation | THEORETICAL COMPUTER SCIENCE, v.447, pp.38 - 43 | - |
dc.relation.isPartOf | THEORETICAL COMPUTER SCIENCE | - |
dc.citation.title | THEORETICAL COMPUTER SCIENCE | - |
dc.citation.volume | 447 | - |
dc.citation.startPage | 38 | - |
dc.citation.endPage | 43 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordAuthor | Polynomial-time approximation | - |
dc.subject.keywordAuthor | Minimum connected dominating set | - |
dc.subject.keywordAuthor | Routing cost constraint | - |
dc.subject.keywordAuthor | Wireless sensor networks | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.