An improved DV-Hop localisation algorithm

Abstract

DV-Hop localisation algorithm is a kind of the localisation algorithms without ranging and simple process. However, when the distribution of sensor nodes is uneven or irregular, the algorithm's precision is lower. Aiming at the shortcomings of the DV-Hop localisation algorithm, this paper proposes an improved DV-Hop localisation algorithm. This algorithm calculates the hop size by the average of the maximum and minimum hop size that the traditional algorithm computed. In addition, we use BFO algorithm to solve node coordinates, in order to improve the algorithm convergence and avoid the algorithm falling into local optimum. The simulation experiment shows that the proposed algorithm can reduce the positioning error of the algorithm under the network environment of the node sparse and irregular distribution. At the same time, this algorithm can improve the convergence of the algorithm.