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

International Association of Online Engineering

Zheng-Chuang Wang¹  Han-Sheng Yang¹  Xin Qiao² 

[1]School of Mechanical and Electrical Engineering, Chaohu University

[2]School of Mechanical and Electrical Engineering, Chaohu University,

关键词: Wireless sensor networks;    DV-hop algorithm;    Localization;    L-M algorithm;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: International Association of Online Engineering

【 摘 要 】

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%.

【 授权许可】

Unknown