On bounding node-to-sink latency in wireless sensor networks with multiple sinks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Donghyun | - |
dc.contributor.author | Wang, Wei | - |
dc.contributor.author | Wu, Weili | - |
dc.contributor.author | Li, Deying | - |
dc.contributor.author | Ma, Changcun | - |
dc.contributor.author | Sohaee, Nassim | - |
dc.contributor.author | Lee, Wonjun | - |
dc.contributor.author | Wang, Yuexuan | - |
dc.contributor.author | Du, Ding-Zhu | - |
dc.date.accessioned | 2021-09-06T11:33:31Z | - |
dc.date.available | 2021-09-06T11:33:31Z | - |
dc.date.created | 2021-06-14 | - |
dc.date.issued | 2013 | - |
dc.identifier.issn | 1748-1279 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/106538 | - |
dc.description.abstract | Bounding node-to-sink latency is an important issue of wireless sensor networks (WSNs) with a quality of service requirement. This paper proposes to deploy multiple sinks to control the worst case node-to-sink data latency in WSNs. The end-to-end latency in multihop wireless networks is known to be proportional to the hop length of the routing path that the message moves over. Therefore, we formulate the question of what is the minimum number of sinks and their locations to bound the latency as the minimum d-hop sink placement problem. We also consider its capacitated version. We show problems are NP-hard in unit disk graph (UDG) and unit ball graph, and propose constant factor approximations of the problems in both graph models. We further extend our algorithms so that they can work well in more realistic quasi UDG model. A simulation study is also conducted to see the average performance of our algorithms. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | INDERSCIENCE ENTERPRISES LTD | - |
dc.subject | PLACEMENT | - |
dc.title | On bounding node-to-sink latency in wireless sensor networks with multiple sinks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Wonjun | - |
dc.identifier.doi | 10.1504/IJSNET.2013.052729 | - |
dc.identifier.scopusid | 2-s2.0-84875664144 | - |
dc.identifier.wosid | 000318684300002 | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF SENSOR NETWORKS, v.13, no.1, pp.13 - 29 | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF SENSOR NETWORKS | - |
dc.citation.title | INTERNATIONAL JOURNAL OF SENSOR NETWORKS | - |
dc.citation.volume | 13 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 13 | - |
dc.citation.endPage | 29 | - |
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 | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | PLACEMENT | - |
dc.subject.keywordAuthor | WSNs | - |
dc.subject.keywordAuthor | wireless sensor networks | - |
dc.subject.keywordAuthor | multiple sink placement | - |
dc.subject.keywordAuthor | relay node placement | - |
dc.subject.keywordAuthor | mobile computing | - |
dc.subject.keywordAuthor | approximation algorithm | - |
dc.subject.keywordAuthor | graph theory | - |
dc.subject.keywordAuthor | UDG | - |
dc.subject.keywordAuthor | unit disk graph | - |
dc.subject.keywordAuthor | UBG | - |
dc.subject.keywordAuthor | unit ball graph | - |
dc.subject.keywordAuthor | quasi unit disk graph | - |
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.