基于多通信半径与改进阿基米德算法的DV-Hop定位算法
DOI:
作者:
作者单位:

广西高校先进制造与自动化技术重点实验室(桂林理工大学)

作者简介:

通讯作者:

中图分类号:

TP393

基金项目:

国家自然科学(61741303) ;广西空间信息与测绘重点实验室基金项目(21-238-21-16)


DV-Hop localization algorithm based on multi-communication radius and improved Archimedes optimization algorithm
Author:
Affiliation:

Key Laboratory of Advanced Manufacturing and Automation Technology(Guilin University of Technology)

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对DV-Hop定位算法中未知节点估计位置与实际位置偏差较大的问题,提出了基于多通信半径与改进阿基米德算法的DV-Hop定位算法。首先,采用锚节点通信半径多级数分层的方法,减小未知节点最小跳数选取的误差;然后,对阿基米德算法中三个步骤进行改进,提高了算法的性能;最后,通过改进的阿基米德算法计算未知节点坐标。实验结果表明,相同环境下,提出的改进算法具有更好的定位效果。

    Abstract:

    A DV-Hop localization algorithm based on multi-communication radius and improved Archimedes optimization algorithm was proposed to address the problem of significant deviation of unknown nodes between the estimated position and the actual position in traditional DV-Hop algorithm. Firstly, the method of multi- communication radius for anchor nodes was adopted to reduce the error of unknown nodes in selecting the minimum number of hops. Then, improvements were made to the three steps of the Archimedes algorithm to improve its performance. Finally, the unknown nodes’ coordinates were obtained using improved Archimedes algorithm. The experimental results show that the proposed algorithm has better localization performance in the same environment.

    参考文献
    相似文献
    引证文献
引用本文

黄自晨. 基于多通信半径与改进阿基米德算法的DV-Hop定位算法[J]. 科学技术与工程, , ():

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2023-10-27
  • 最后修改日期:2024-05-18
  • 录用日期:2024-05-21
  • 在线发布日期:
  • 出版日期:
×
亟待确认版面费归属稿件,敬请作者关注