Multihop range-free localization with approximate shortest path in anisotropic networks
- Authors
- Lee, Sangwoo; Choi, Jaehoon; Kim,Sunwoo
- Issue Date
- Jun-2014
- Publisher
- IEEE Computer Society
- Citation
- 2014 IEEE International Conference on Communications, ICC 2014, pp.154 - 159
- Indexed
- SCOPUS
- Journal Title
- 2014 IEEE International Conference on Communications, ICC 2014
- Start Page
- 154
- End Page
- 159
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/159783
- DOI
- 10.1109/ICC.2014.6883311
- ISSN
- 0000-0000
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/159783)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.