Improved DV-Hop Node Localization Algorithm in Wireless Sensor Networks

Xiao Chen and Benliang Zhang

International Journal of Distributed Sensor Networks, 2012, vol. 8, issue 8, 213980

Abstract: An improved algorithm is put forward to improve the poor locating performance of the DV-Hop algorithm, which is one of the range-free algorithms in wireless sensor networks. Firstly, we set some anchor nodes at the border land of monitoring regions. Secondly, the average one-hop distance between anchor nodes is modified, and the average one-hop distance used by each unknown node for estimating its location is modified through weighting the received average one-hop distances from anchor nodes. Finally, we use the particle swarm optimization to correct the position estimated by the 2D hyperbolic localization algorithm, which makes the result closer to the actual position. The simulation results show that the proposed algorithm has better localization performance in the localization precision and stability than the basic DV-Hop algorithm and some existing improved algorithms.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2012/213980 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:8:y:2012:i:8:p:213980

DOI: 10.1155/2012/213980

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().