Iterative L-M Algorithm in WSN – Utilizing Modifying Average Hopping Distances

Authors

  • Xin Qiao School of Mechanical and Electrical Engineering, Chaohu University,
  • Han-Sheng Yang School of Mechanical and Electrical Engineering, Chaohu University
  • Zheng-Chuang Wang School of Mechanical and Electrical Engineering, Chaohu University

DOI:

https://doi.org/10.3991/ijoe.v13i10.7006

Keywords:

Wireless sensor networks, DV-hop algorithm, Localization, L-M algorithm

Abstract


Wireless sensor networks are more and more important for various applications. Localization plays an important role in WSN. In this article, Aiming at the large errors that the DV—Hop localization algorithm have in net topology with randomly-distributed nodes, this paper proposed a CLDV-Hop algorithm in DV-Hop based on modifying average hopping distances. Firstly, hop count threshold is set to optimize the anchor node when data exchange. Then, according to the minimum mean square criteria and unknown nodes nearest three anchor nodes weighted average hop distance are selected as its average hop distance. Finally, L-M algorithm is used to optimize the coordinate of unknown node estimated by least squares. The simulation results show that, without increasing the overhead and the same conditions as the simulation environment, CLDV-Hop algorithm has higher positioning accuracy than existing improved algorithms, and compared with DV-Hop algorithm accuracy is improved by about 33% - 41%.

Downloads

Published

2017-11-07

How to Cite

Qiao, X., Yang, H.-S., & Wang, Z.-C. (2017). Iterative L-M Algorithm in WSN – Utilizing Modifying Average Hopping Distances. International Journal of Online and Biomedical Engineering (iJOE), 13(10), pp. 4–20. https://doi.org/10.3991/ijoe.v13i10.7006

Issue

Section

Papers