By Topic

An Improved DV-Hop Localization Algorithm in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ning Yu ; Beijing University of Posts and Telecommunications, Beijing 100876, China, mail.yuning@gmail.com ; Jiangwen Wan ; Qing Song ; Yinfeng Wu

A limit DV-hop (LDV-hop) algorithm is put forward based on comprehensive analysis of DV-hop localization algorithms, in order to satisfy the characters of low cost and low power in WSNs. The least hop number between nodes and landmarks is counted firstly and the distance in hops is then computed. Finally the coordinates of nodes are determined. LDV-hop algorithm is simulated in network simulator (Ns-2) and the experimental results are presented. Comparison shows LDV-hop algorithm is useful to improve the accuracy of localization and reduce the number of communication messages. Different node distributions are discussed to give the result that the algorithm is adaptive to irregular distribution shape of sensor nodes.

Published in:

2006 IEEE International Conference on Information Acquisition

Date of Conference:

20-23 Aug. 2006