DV-Hop algorithm for adaptive hop-count improvement and average hop distance optimization

Article type: Research Article

Authors: Ren, Keqiang^{; *} | Wu, Mingkang

Affiliations: School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou Jiangxi 341000, China

Correspondence: [*] Corresponding author. E-mail: jxrenkeqiang@163.com.

Abstract: In order to improve the localization accuracy of unknown nodes in DV-Hop algorithm, an improved DV-Hop algorithm combined with adaptive hop count and optimized hop distance was proposed. Our proposed algorithm firstly introduced the concept of the adaptive value for the number of communication radii. It was used to adaptively select the number of communication radii for beacon nodes and could realize the subdivision of the minimum hop count. Secondly, sensor nodes adaptively set the hop threshold to reduce the calculation. Finally, the calculation method of the average hop distance of beacon nodes was optimized and the error was corrected. The average hop distance of unknown nodes was obtained by the weighted normalization used for the average hop distance of beacon nodes. Simulation results in both random deployment environment of sensor nodes and nonrandom deployment environment of beacon nodes demonstrate that the localization accuracy of our proposed algorithm is significantly better than the DV-Hop algorithm and furthermore has better robustness and adaptability.

Keywords: Wireless sensor networks, DV-Hop algorithm, adaptive, average hop distance, weighted average

DOI: 10.3233/JHS-190607

Journal: Journal of High Speed Networks, vol. 25, no. 2, pp. 127-137, 2019