Improved DV-Hop Localization Algorithm for Wireless Sensor Networks 
Jamal Kutty1, Kanika Sharama2
1Jamal Kutty* Electronics and Communication Engineering, National Institute of Technical Teachers’ Training and Research , Chandigarh, India.
2Dr. Kanika Sharama, Electronics and Communication Engineering, NITTTR, Chandigarh, India.
Manuscript received on June 08, 2020. | Revised Manuscript received on June 25, 2020. | Manuscript published on June 30, 2020. | PP: 1324-1330 | Volume-9 Issue-5, June 2020. | Retrieval Number: E1048069520/2020©BEIESP | DOI: 10.35940/ijeat.E1048.069520
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Considering the emerging applications of Wireless Sensor Network, the localization of sensor nodes is very important in some applications. Hence in this paper, proposed an improved Distance-Vector hop technique to reduce the localization error generated in the classical method of range free DV-hop algorithm. The proposed algorithm targets to minimize the error introduced in the average hop-size value by the series of mathematical corrections like minimum mean squared error method, modifying the average hop-value value calculated between known sensor nodes with respect to error-term calculated by comparing the estimated distance with actual distance or Euclidean value of anchor nodes, by using dynamic coefficient of weight with respect to minimum number of hopes, calculating x and y co-ordinates of unknown by using 2-D-hyperbolic method. The final corrections on the x and y values are done by using some geometrical methods. Simulations and results are executed on three different evolution models of network by varying radius of communication range, anchor node percentage and number of sensor nodes.
Keywords: DV-Hop, localization, Range-free, Wireless sensor networks.