Localization Algorithm Based on DV-HOP for Wireless Sensor Network

Article Preview

Abstract:

An improved DV-HOP localization algorithm is proposed in the paper, aiming at the traditional DV-HOP localization algorithm. The improved algorithm introduces threshold M, it uses the weighted average hop distances of anchor nodes within M hops to calculate the average hop distance of unknown nodes. In addition, the positioning results are corrected in the improved algorithm. The simulation results show that the improved localization algorithm effectively improves the positioning accuracy compared with the traditional DV-HOP localization algorithm, it is an effective localization algorithm for the wireless sensor networks.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

909-913

Citation:

Online since:

October 2011

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Sun limin, Li Jianzhong, Chen yu, etc. Wireless Sensor Network [M]. Beijing: Tsinghua University Press.

Google Scholar

[2] Niculescu D, Nath B. DV Based Positioning in Ad-Hoc Networks[J]. Journal of Telecom -munication Systems, 2003, 22(1-4): 267-280.

Google Scholar

[3] Zhang Jia; Wu Yanhai; Shi feng; Geng fang. Localization algorithm based on DV-HOP for wireless sensor networks. Journal of Computer Applications, 2010, 30(2): 323-326.

DOI: 10.3724/sp.j.1087.2010.00323

Google Scholar

[4] Yu Ning. Localization Optimization Methods for Wireless Sensor Networks [D]. Beijing University of Posts and Telecommunications Ph.D. Thesis, 2008, 13-24.

Google Scholar