Abstract
With the increasing realization of the Internet-of-Things (IoT) and rapid proliferation of wireless sensor networks (WSN), estimating the location of wireless sensor nodes is emerging as an important issue. Traditional ranging based localization algorithms use triangulation for estimating the physical location of only those wireless nodes that are within one-hop distance from the anchor nodes. Multi-hop localization algorithms, on the other hand, aim at localizing the wireless nodes that can physically be residing at multiple hops away from anchor nodes. These latter algorithms have attracted a growing interest from research community due to the smaller number of required anchor nodes. One such algorithm, known as DV-Hop (Distance Vector Hop), has gained popularity due to its simplicity and lower cost. However, DV-Hop suffers from reduced accuracy due to the fact that it exploits only the network topology (i.e., number of hops to anchors) rather than the distances between pairs of nodes. In this paper, we propose an enhanced DV-Hop localization algorithm that also uses the RSSI values associated with links between one-hop neighbors. Moreover, we exploit already localized nodes by promoting them to become additional anchor nodes. Our simulations have shown that the proposed algorithm significantly outperforms the original DV-Hop localization algorithm and two of its recently published variants, namely RSSI Auxiliary Ranging and the Selective 3-Anchor DV-hop algorithm. More precisely, in some scenarios, the proposed algorithm improves the localization accuracy by almost 95%, 90% and 70% as compared to the basic DV-Hop, Selective 3-Anchor, and RSSI DV-Hop algorithms, respectively.
Highlights
There has been an emerging interest in the field of context-aware computing and location-aware services [1,2,3,4], as a part of the Internet of Things (IoT), where the information on geographical location of the constituent nodes becomes an integral part of the sensor data
Localization in wireless sensor networks has attracted a large number of researchers during the last years and, as a result, several localization algorithms have been proposed in the literature
We have proposed an improved version of distance vector-hop (DV-Hop) localization algorithm, named as Hybrid
Summary
There has been an emerging interest in the field of context-aware computing and location-aware services [1,2,3,4], as a part of the Internet of Things (IoT), where the information on geographical location of the constituent nodes becomes an integral part of the sensor data. As compared to range-based localization algorithms, where peer nodes only communicate with their immediate neighboring nodes, the multi-hop localization approach leverages the network topology for estimating the position of sensor nodes that are multiple hops away from the anchor nodes. This approach has the advantage of being able to locate wireless nodes even if these nodes are geographically multiple hops away from the anchors nodes. Most multi-hop localization algorithms require strong connectivity between sensor nodes and high-density within the network in order to provide accurate location estimates.
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
