首页> 外文期刊>Journal of High Speed Networks >DV-Hop algorithm for adaptive hop-count improvement and average hop distance optimization
【24h】

DV-Hop algorithm for adaptive hop-count improvement and average hop distance optimization

机译:自适应跳数改进和平均跳跃距离优化的DV-Hop算法

获取原文
获取原文并翻译 | 示例
       

摘要

In order to improve the localization accuracy of unknown nodes in DV-Hop algorithm, an improved DV-Hop algorithm combined with adaptive hop count and optimized hop distance was proposed. Our proposed algorithm firstly introduced the concept of the adaptive value for the number of communication radii. It was used to adaptively select the number of communication radii for beacon nodes and could realize the subdivision of the minimum hop count. Secondly, sensor nodes adaptively set the hop threshold to reduce the calculation. Finally, the calculation method of the average hop distance of beacon nodes was optimized and the error was corrected. The average hop distance of unknown nodes was obtained by the weighted normalization used for the average hop distance of beacon nodes. Simulation results in both random deployment environment of sensor nodes and nonrandom deployment environment of beacon nodes demonstrate that the localization accuracy of our proposed algorithm is significantly better than the DV-Hop algorithm and furthermore has better robustness and adaptability.
机译:为了提高DV-Hop算法中未知节点的定位精度,提出了一种与自适应跳数和优化跳距结合的改进的DV跳算法。我们所提出的算法首先介绍了通信半径数的自适应值的概念。它用于自适应地选择信标节点的通信RADII的数量,并且可以实现最小跳数的细分。其次,传感器节点自适应地设置跳阈值以减少计算。最后,优化了信标节点的平均跳距的计算方法,并校正了错误。通过用于信标节点的平均跳距的加权归一化获得未知节点的平均跳距。仿真导致传感器节点的随机部署环境以及信标节点的非谐波部署环境表明,我们所提出的算法的定位精度明显优于DV-Hop算法,并且还具有更好的鲁棒性和适应性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号