Research on DV-Hop improved algorithm based on dual communication radius

Abstract

Abstract In order to solve the problem that the traditional DV-Hop location algorithm has a large error in locating unknown nodes, this paper proposes an improved DV-Hop algorithm based on dual communication radius. By adding a communication radius, the algorithm updates the minimum hop number obtained by the unknown node closer to the beacon node to a smaller hop value and keeps the minimum hop number information of unknown nodes farther away. This method reflects the gap between the actual distances in terms of hop number, which solves the problem of the large difference between the actual distances of the same hops to a certain extent. Therefore, it is more advantageous to estimate the more accurate average jump distance and can calculate the more precise distance between them and obtain the more precise coordinates of unknown nodes. MATLAB simulation results show that the improved algorithm based on dual communication radius DV-Hop can effectively reduce the location error and improve the location accuracy and stability compared with the traditional DV-Hop location algorithm.

Keywords

• Wireless sensor network
• DV-Hop
• Communication radius
• Location algorithm