Two Novel DV-Hop Localization Algorithms for Randomly Deployed Wireless Sensor Networks

55Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

Aiming at solving the problem of low accuracy in traditional distance vector-hop (DV-hop) algorithm used for wireless sensor networks node location, two refined localization algorithms, that is, hyperbolic-DV-hop localization algorithm and improved weighted centroid DV-hop localization algorithm (IWC-DV-hop), are proposed in this paper. Instead of taking the average HopSize of BeaconNode nearest to the UnknownNode, hyperbolic-DV-hop algorithm chooses the average of average HopSizes of all BeaconNodes, as the average HopSize of the UnknownNode. The ML localization algorithm is also replaced by hyperbolic location algorithm. IWC-DV-hop algorithm improves the accuracy by selecting appropriate BeaconNodes and replacing ML localization with centroid localization. And a weighted scheme is used in IWC-DV-hop so that the influence of different anchors is taken into consideration. Simulations have been conducted to prove that the accuracy is improved by both of the two algorithms and IWC-DV-hop is the best choice.

Cite

CITATION STYLE

APA

Song, G., & Tam, D. (2015). Two Novel DV-Hop Localization Algorithms for Randomly Deployed Wireless Sensor Networks. International Journal of Distributed Sensor Networks, 2015. https://doi.org/10.1155/2015/187670

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free