首页> 外文会议>International Conference on Wireless Communications and Signal Processing >An improved DV-HOP algorithm for indoor positioning based on Bacterial Foraging Optimization
【24h】

An improved DV-HOP algorithm for indoor positioning based on Bacterial Foraging Optimization

机译:一种基于细菌觅食优化的改进型DV-HOP室内定位算法

获取原文

摘要

In order to increase the indoor positioning accuracy and reduce the positioning error in wireless sensor network, the Bacterial Foraging Optimization algorithm is introduced to improve the DV-HOP algorithm. The conventional DV-HOP algorithm is not very accurate in calculating the average distance per-hop, and it greatly affects the positioning accuracy. Hence, a new BFO-DV-HOP (Bacterial Foraging Optimization DV-HOP) algorithm is proposed in this paper. The conventional DV-Hop algorithm calculates the average distance per-hop based on the Euclidean distance and the minimum number of hops directly, and the random distribution of the irregular network topology leads to the low accuracy in average hop distance estimation. In BFO-DV-HOP algorithm, the average distance per-hop is calculated by the Bacterial Foraging Optimization algorithm (BFO) by using the minimum hops of nodes and the position information of anchor nodes. Simulation results show that 30% beacon anchors can effectively reduce the positioning error, and 10% beacon anchors can get a better performance compared with conventional algorithms.
机译:为了提高室内定位精度,减少无线传感器网络中的定位误差,引入细菌觅食优化算法对DV-HOP算法进行了改进。传统的DV-HOP算法在计算每跳平均距离时不是很准确,并且极大地影响了定位精度。因此,本文提出了一种新的BFO-DV-HOP(细菌觅食优化DV-HOP)算法。传统的DV-Hop算法直接基于欧氏距离和最小跳数来计算每跳的平均距离,不规则网络拓扑的随机分布导致平均跳距估计的准确性较低。在BFO-DV-HOP算法中,细菌觅食优化算法(BFO)通过使用节点的最小跳数和锚节点的位置信息来计算每跳的平均距离。仿真结果表明,与传统算法相比,信标锚30%可以有效降低定位误差,信标锚10%可以获得更好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号