Multihop range-free localization with approximate shortest path in anisotropic networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Sangwoo | - |
dc.contributor.author | Choi, Jaehoon | - |
dc.contributor.author | Kim,Sunwoo | - |
dc.date.accessioned | 2022-07-16T04:26:40Z | - |
dc.date.available | 2022-07-16T04:26:40Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2014-06 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/159783 | - |
dc.description.abstract | This paper presents a multihop range-free localization algorithm that tolerates network anisotropy with a small number of anchors. A detoured path detection is proposed which measures the deviation in the hop count between the direct and shortest paths of a node pair. A novel distance estimation method is introduced to approximate the shortest path based on the path deviation and to estimate their Euclidean distance by taking into account the extent of the detour of the approximate shortest path. Compared to other range-free localization algorithms, the proposed algorithm requires fewer anchors while achieving higher localization accuracy in anisotropic networks. We demonstrated its superiority over existing range-free localization algorithms through extensive computer simulations. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE Computer Society | - |
dc.title | Multihop range-free localization with approximate shortest path in anisotropic networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choi, Jaehoon | - |
dc.identifier.doi | 10.1109/ICC.2014.6883311 | - |
dc.identifier.scopusid | 2-s2.0-84906997886 | - |
dc.identifier.bibliographicCitation | 2014 IEEE International Conference on Communications, ICC 2014, pp.154 - 159 | - |
dc.relation.isPartOf | 2014 IEEE International Conference on Communications, ICC 2014 | - |
dc.citation.title | 2014 IEEE International Conference on Communications, ICC 2014 | - |
dc.citation.startPage | 154 | - |
dc.citation.endPage | 159 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Anisotropy | - |
dc.subject.keywordPlus | Computer simulation | - |
dc.subject.keywordPlus | Graph theory | - |
dc.subject.keywordPlus | Anisotropic networks | - |
dc.subject.keywordPlus | Distance estimation | - |
dc.subject.keywordPlus | Euclidean distance | - |
dc.subject.keywordPlus | Localization accuracy | - |
dc.subject.keywordPlus | Node pairs | - |
dc.subject.keywordPlus | Path detections | - |
dc.subject.keywordPlus | Range-free localizations | - |
dc.subject.keywordPlus | Shortest path | - |
dc.subject.keywordPlus | Algorithms | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/6883311 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.