• Please send your full manuscript to: jcm@etpub.com

LSDV-Hop: Least Squares Based DV-Hop Localization Algorithm for Wireless Sensor Networks

Shujing Zhang 1, Jing Li 2, Bo He 3, and Jiaxing Chen 2
1. College of Vocation Technology, Hebei Normal University, Shijiazhuang, China
2. College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang, China
3. College of Information Science and Engineering, Ocean University of China, Qingdao, China
Abstract—Wireless Sensor Networks (WSNs) have increasingly become a hot spot of research and application in the fields of computer networks and telecommunications. It is undoubtedly one of the most important issues for WSNs to search an accurate and effective localization method. In this paper, an improved DV-Hop localization algorithm, called least squares DV-Hop (LSDV-Hop), is proposed based on the theory of least squares. LSDV-Hop aims to improve the localization accuracy by extracting a least squares transformation vector between the true and estimated location data of anchor nodes which are randomly chosen. Then, the estimated location data of unknown nodes are updated by the obtained least squares transformation vector, which is helpful to weaken the error of the traditional DV-Hop algorithm. Results of simulation experiments show that the proposed LSDV-Hop method can improve the localization accuracy without increasing the hardware cost for sensor nodes compared with the counterparts.

Index Terms—Wireless sensor networks, Localization, DV-Hop, least squares, quaternion approach

Cite: Shujing Zhang, Jing Li, Bo He, and Jiaxing Chen, “LSDV-Hop: Least Squares Based DV-Hop Localization Algorithm for Wireless Sensor Networks," Journal of Communications, vol. 11, no. 3, pp. 243-248, 2016. Doi: 10.12720/jcm.11.3.243-248
Copyright © 2013-2017 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com