Research and Improvement of DV-Hop Localization Algorithm for Wireless Sensor Network

Abstract:

Rang-free distributed localization algorithm has advantages of low power consumption, low cost etc, but it is weak in the localization accuracy, energy consumption of localization and the algorithm extend ability.That can not meet to the needs of practical application. To overcome the disadvantage of DV-Hop algorithm, in this paper, Two aspects improved algorithm are proposed based on the characteristics research of the original DV-Hop localization algorithm, which are the coverage area of beacon nodes and average size for one hop received by unknown nodes. Simulation results prove their validity and show the performance of the improvement algorithms is superior to the original DV-Hop algorithm.

• Periodical: Applied Mechanics and Materials (Volumes 44-47)
• Pages: 4028-4032
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.44-47.4028
• Online since: December 2010
• Authors: Xue Guang Wang, Jie Ke Lin
• Keywords: DV-Hop Algorithm, Node Localization, Rang-Free, Wireless Sensor Network (WSN)

References

[1] Zhang Lin et al, Study of Range-free Localization Algorithm For Wireless Sensor Network，Computer Development & Applications, Vol. 43-11(2009).

[2] Y. Dai, J. Wang, Research and Improvement of Localization Algorithms for Wireless Sensor Networks, Chinese Journal Of Sensors & Actuators, Vol. 23-4(2009).

[3] Niculescu D S. Forwarding and Positioning Problems in ad hoc Networks[D]. Camden: The State University of New Jersey, (2004), pp.29-33.

[4] K. Langendoen, N. Reijers. Distributed Localization In Wireless Sensor Networks: A Quantitative Comparison. Comput. Networks, Vol. 43-4(2003), pp.499-518.

DOI: 10.1016/s1389-1286(03)00356-6

[5] Priyantha N B, Balakrishnam H, Demaine E, et al. Anchor2Free Distributed Localization in Sensor Networks, Technical Report MIT2LCS2TR2892 [R]. Cambrige: M IT Lab for Computer Science, (2003).