Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ding, Ling | - |
dc.contributor.author | Wu, Weili | - |
dc.contributor.author | Willson, James | - |
dc.contributor.author | Du, Hongjie | - |
dc.contributor.author | Lee, Wonjun | - |
dc.contributor.author | Du, Ding-Zhu | - |
dc.date.accessioned | 2021-09-07T08:00:47Z | - |
dc.date.available | 2021-09-07T08:00:47Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2011-10 | - |
dc.identifier.issn | 1045-9219 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/111527 | - |
dc.description.abstract | Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this paper, a special CDS, named alpha Minimum rOuting Cost CDS (alpha-MOC-CDS), will be studied to improve the performance of CDS based broadcasting and routing. In this paper, we prove that construction of a minimum alpha MOC-CDS is NP-hard in a general graph and we propose a heuristic algorithm for construction of alpha-MOC-CDS. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.subject | CONNECTED DOMINATING SETS | - |
dc.subject | UNIT DISK GRAPHS | - |
dc.subject | CONSTRUCTION | - |
dc.subject | APPROXIMATION | - |
dc.title | Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Wonjun | - |
dc.identifier.doi | 10.1109/TPDS.2011.30 | - |
dc.identifier.scopusid | 2-s2.0-80052324399 | - |
dc.identifier.wosid | 000294162500001 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.22, no.10, pp.1601 - 1609 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | - |
dc.citation.title | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | - |
dc.citation.volume | 22 | - |
dc.citation.number | 10 | - |
dc.citation.startPage | 1601 | - |
dc.citation.endPage | 1609 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | CONNECTED DOMINATING SETS | - |
dc.subject.keywordPlus | UNIT DISK GRAPHS | - |
dc.subject.keywordPlus | CONSTRUCTION | - |
dc.subject.keywordPlus | APPROXIMATION | - |
dc.subject.keywordAuthor | Connected dominating set | - |
dc.subject.keywordAuthor | routing path | - |
dc.subject.keywordAuthor | wireless network | - |
dc.subject.keywordAuthor | obstacle | - |
dc.subject.keywordAuthor | general graph | - |
dc.subject.keywordAuthor | NP-hard | - |
dc.subject.keywordAuthor | topology control | - |
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.