• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

计算机工程与科学 ›› 2022, Vol. 44 ›› Issue (01): 75-83.

• 计算机网络与信息安全 • 上一篇    下一篇

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

张晶1,2,3,4,李煜1,3,4   

  1. (1.昆明理工大学信息工程与自动化学院,云南 昆明 650500;2.云南枭润科技服务有限公司,云南 昆明 650500;

    3.昆明理工大学云南省人工智能重点实验室,云南 昆明 650500;
    4.昆明理工大学云南省计算机技术应用重点实验室,云南 昆明 650500)

  • 收稿日期:2020-07-30 修回日期:2021-01-04 接受日期:2022-01-25 出版日期:2022-01-25 发布日期:2022-01-13
  • 基金资助:
    云南省基础研究计划重点项目(202101AS070016);2020年云南省研究生优质课程“算法分析与设计”建设项目(109920210048);
    云南省“万人计划”产业技术领军人才项目(云发改人事[2019]1096号);云南省技术创新人才项目(2019HB113)

An improved unconstrained optimization 3D-DV-Hop localization

ZHANG Jing1,2,3,4,LI Yu1,3,4   

  1. (1.Faculty of Information Engineering and Automation,Kunming University of Science and Technology,Kunming 650500;

    2. Yunnan Xiaorun Technology Service Co.,Ltd.,Kunming 650500;

    3.Yunnan Key Laboratory of Artificial Intelligence,Kunming University of Science and Technology,Kunming 650500;

    4. Key Laboratory of Computer Technology Application of Yunnan Province,
    Kunming University of Science and Technology,Kunming 650500,China)
  • Received:2020-07-30 Revised:2021-01-04 Accepted:2022-01-25 Online:2022-01-25 Published:2022-01-13

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

关键词: 跳数优化, 跳距加权, 无约束优化, 拉格朗日乘子法

Abstract: 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.


Key words: hop count optimization, hop-size weighting, unconstrained optimization, Lagrangian multiplier