DV-Hop Wireless Sensor LocationAlgorithm Based on SimulatedAnnealingAlgorithm

ZHOU Ding-dong ZHANG Chun ZHANG Jie SU Qian

Computer & Telecommunication ›› 2020, Vol. 1 ›› Issue (5) : 29-32.

Computer & Telecommunication ›› 2020, Vol. 1 ›› Issue (5) : 29-32.

DV-Hop Wireless Sensor LocationAlgorithm Based on SimulatedAnnealingAlgorithm

Author information +
History +

Abstract

In the classical DV-Hop algorithm, the estimation of unknown point coordinates by the hop distance and least squares method will lead to large errors. To solve this problem, a weighting factor is introduced to correct the average hop distance, and a simulated annealing algorithm is used instead of the least squares method to solve the unknown node coordinates. The number of beacon nodes and communication radius are taken as variables to study the improvement effect. The experimental results show that the positioning accuracy of the improved positioning algorithm is significantly improved, and the error rate is significantly reduced with fewer beacon nodes and smaller communication radius, which has higher practical application value.

Key words

wireless sensor network / DV-Hop location algorithm / simulated annealing algorithm / node location

Cite this article

Download Citations
ZHOU Ding-dong ZHANG Chun ZHANG Jie SU Qian. DV-Hop Wireless Sensor LocationAlgorithm Based on SimulatedAnnealingAlgorithm[J]. Computer & Telecommunication. 2020, 1(5): 29-32

Accesses

Citation

Detail

Sections
Recommended

/