WSN Location Algorithm Based on Efficient Simulated Annealing Weighted DV-Hop

The positioning accuracy of the sensors is not high when the classic DV-Hop method is used, because the average distance of adjacent sensors estimated by the classic algorithm cannot accurately reflect the true average distance of the network, leading to a large error, and the DV-Hop algorithm will lose some information when solving with the least squares method. This paper proposes a weighted DV-Hop method taking advantage of efficient simulated annealing. This algorithm firstly finds the influence of different known nodes on unknown nodes, and weights the average distance of each known node. At this time, the average distance of adjacent nodes is closer to the real average distance of the network. Finally, using the efficient simulated annealing algorithm gets the location of unknown nodes. The experimental results of Matlab indicates the proposed positioning method has higher precision.