Abstract
AbstractThis paper presents a multihop range-free localization algorithm that tolerates network anisotropy with a small number of anchors. A detoured path detection is proposed to detect if the shortest path between nodes is detoured from their direct path by measuring the deviation in the hop count between the direct and shortest paths. A novel distance estimation method is introduced to approximate the shortest path based on the path deviation and to estimate their distance by taking into account the extent of the detour of the approximate shortest path. Compared to other range-free 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.
Highlights
In wireless sensor networks (WSNs), localization has received a great deal of attention since it facilitates a variety of applications [1] such as environmental monitoring, health care, target tracking, and military surveillance
This paper presents a distributed multihop range-free localization algorithm to mitigate the effects of network anisotropy with a small number of anchors
A multihop range-free localization algorithm with approximate shortest paths was proposed for anisotropic networks
Summary
In wireless sensor networks (WSNs), localization has received a great deal of attention since it facilitates a variety of applications [1] such as environmental monitoring, health care, target tracking, and military surveillance. Multihop range-free approaches [11,12,13] exploit network connectivity information (i.e., the hop count of the shortest path between nodes) to localize normal nodes with a limited number of anchors in large-scale networks. 3.1 Overview This section presents a multihop range-free localization algorithm that estimates the distance between an anchor and a normal node by taking into account how much their shortest path is detoured from their direct path. To solve the detoured path detection problem for an anchor-to-normal node pair, we approximate the anchor pair’s compound shortest path to bypass a virtual hole between the anchors based on the path deviation (i.e., the difference between the expected hop count and the hop count of the compound shortest path). Throughout this paper, we omit the subscript indicating normal nodes in the expected hop count and the mean distance
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
