A DV-Hop positioning algorithm combining sine and cosine optimization and hop distance optimization.

In order to solve the problems of imprecise calculation of the hop distance and inaccurate positioning due to the inability of the least squares solution to reach the optimal unbiased state in the DV-Hop positioning algorithm, a DV-Hop positioning algorithm combining sine and cosine optimization and hop distances optimization is proposed, which defines the concept of the optimised anchor node. Firstly, the anchor node with the smallest average hop distance among all anchor nodes around each unknown node is selected as the optimized anchor node in the algorithm, then any other anchor node is selected to form a triangle with other unknown nodes, and the edge from the optimal anchor node to the unknown node is considered to be the optimal edge in the triangle. Secondly, the distances from the other anchor nodes to the unknown nodes are calculated to optimize the hop distances by the law of cosine. Finally, the sine-cosine optimization algorithm is used to improve the least square method, and the volatility of the sine-cosine function is used to find the optimal position of the unknown node. The experimental results indicate that, compared with the conventional DV-Hop and DV-Hop improvement algorithms, the proposal reduces the positioning error significantly. [ABSTRACT FROM AUTHOR]