改进的无约束优化3D-DV-Hop定位算法

An improved unconstrained optimization 3D-DV-Hop localization

针对传统DV-Hop三维定位算法定位误差较大,且机器学习及仿生算法计算任务繁重的缺点,提出一种改进的无约束优化3D-DV-Hop定位算法,采用二通信半径策略计算最小跳数值,提出平方代价函数对锚节点跳距值进行优化处理,并将其加权跳距值作为未知节点跳距值,最后根据约束问题的无约束求解思想,将加权误差最小化进而求解。通过与传统算法和各类改进算法在3种条件下进行仿真对比,验证了该优化算法在较低计算量的情况下定位误差显著降低。

Aiming at the disadvantages of the traditional 3D DV-Hop positioning algorithm with large positioning errors and heavy calculation of machine learning and bionic algorithms,an improved unconstrained optimization 3D DV-Hop positioning algorithm is proposed.In terms of hop count,a two-communication radius strategy is adopted to calculate the minimum hop value.In terms of hop distance,a square cost function method is proposed to optimize the anchor node hop distance value,and its weighted hop distance value is used as the unknown node hop distance value.Finally,according to the unconstrained solution idea of the constraint problem,the weighted error is minimized and then solved.Through simulation comparison with traditional algorithms and various improved algorithms under three conditions,it is verified that the optimization algorithm can significantly reduce the positioning error under the condition of low calculation amount.