Improvement on the DV-hop localization algorithm based on average hop distance optimization

Wireless sensor networks, which have numerous uses in numerous industries, have attracted more attention over the past few years. Node localization is one of the gordian technology to locate in it. This research sought to address the low precision of the classic DV-hop algorithm in the context of wireless sensor networks. This novel DV-hop localization algorithm is given some practical solutions in this paper. The results of the simulations demonstrate that the new method can improve accuracy and increase communication range. First of all, the least squares method is applied to correct the average length of each hop between beacon nodes. In addition, an error distance matrix is defined as an intermediate variable to reckon the average length between the unknown node and the beacon node for each jump and select the minor error distance matrix. Finally, this improved algorithm chooses the minimum error distance matrix from the previous steps and modifies it. Simulation consequences reveal that this modified algorithm can better enhance the accuracy and extend the communication range.