A Location Algorithm for Optimizating of Average Jump Distance

Due to the deviation of hop number and hop distance estimation in traditional DV-Hop localization algorithm, the accuracy of localization is affected. The paper presents a localization algorithm for optimizing average jump distance. The algorithm uses the beacon path distance between beacon nodes instead of the linear distance between them. In addition, the communication radius of each node is divided into non-equal dichotomies instead of fixed communication radius. Simulation results show that the localization algorithm proposed in the paper can effectively improve the localization accuracy and stability of unknown nodes by optimizing the average jump distance of beacon nodes.