Minimum Data-Latency-Bound k-Sink Placement Problem in Wireless Sensor Networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Donghyun | - |
dc.contributor.author | Wang, Wei | - |
dc.contributor.author | Sohaee, Nassim | - |
dc.contributor.author | Ma, Changcun | - |
dc.contributor.author | Wu, Weili | - |
dc.contributor.author | Lee, Wonjun | - |
dc.contributor.author | Du, Ding-Zhu | - |
dc.date.accessioned | 2021-09-07T07:39:47Z | - |
dc.date.available | 2021-09-07T07:39:47Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2011-10 | - |
dc.identifier.issn | 1063-6692 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/111411 | - |
dc.description.abstract | In this paper, we propose a new multiple-sink positioning problem in wireless sensor networks to best support realtime applications. We formally define this problem as the k-Sink Placement Problem (k-SPP) and prove that it is APX-complete. We show that an existing approximation algorithm for the well-known k-center problem is a constant factor approximation of k-SPP. Furthermore, we introduce a new greedy algorithm for k-SPP and prove its approximation ratio is very near to the best achievable, 2. Via simulations, we show our algorithm outperforms its competitor on average. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | APPROXIMATION ALGORITHMS | - |
dc.title | Minimum Data-Latency-Bound k-Sink Placement Problem in Wireless Sensor Networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Wonjun | - |
dc.identifier.doi | 10.1109/TNET.2011.2109394 | - |
dc.identifier.scopusid | 2-s2.0-80054116082 | - |
dc.identifier.wosid | 000296014000008 | - |
dc.identifier.bibliographicCitation | IEEE-ACM TRANSACTIONS ON NETWORKING, v.19, no.5, pp.1344 - 1353 | - |
dc.relation.isPartOf | IEEE-ACM TRANSACTIONS ON NETWORKING | - |
dc.citation.title | IEEE-ACM TRANSACTIONS ON NETWORKING | - |
dc.citation.volume | 19 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 1344 | - |
dc.citation.endPage | 1353 | - |
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.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | APPROXIMATION ALGORITHMS | - |
dc.subject.keywordAuthor | Graph theory | - |
dc.subject.keywordAuthor | greedy approximation algorithms | - |
dc.subject.keywordAuthor | network center placement problem | - |
dc.subject.keywordAuthor | wireless sensor networks (WSNs) | - |
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.