Improved DV-Hop Node Localization Algorithm in Wireless Sensor Networks | Zendy

Xiao Chen | Zendy; Benliang Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Improved DV-Hop Node Localization Algorithm in Wireless Sensor Networks

Author(s) -

Xiao Chen,

Benliang Zhang

Publication year - 2012

Publication title -

international journal of distributed sensor networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.324

H-Index - 53

eISSN - 1550-1477

pISSN - 1550-1329

DOI - 10.1155/2012/213980

Subject(s) - computer science , hop (telecommunications) , algorithm , wireless sensor network , particle swarm optimization , weighting , node (physics) , position (finance) , computer network , medicine , structural engineering , finance , engineering , economics , radiology

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. © 2012 Xiao Chen and Benliang Zhang.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research