首页> 外文期刊>Applied Soft Computing >A high accurate localization algorithm with DV-Hop and differential evolution for wireless sensor network
【24h】

A high accurate localization algorithm with DV-Hop and differential evolution for wireless sensor network

机译:一种高准确的定位算法,具有无线传感器网络的DV跳和差分演进

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

摘要

Localization technology has been a core component for Internet of Things (IoT), especially for Wireless Sensor Network (WSN). Among all localization technologies, Distance Vector-Hop (DV-Hop) algorithm is a very frequently used algorithm for WSN. DV-Hop estimates the distance through the hop-count between nodes in which the value of hop-count is discrete, and thus there is a serious consequence that some nodes have the same estimated distance when their hop-count with respect to identical node is equal. In this paper, we ameliorate the value of hop-count by the number of common one-hop nodes between adjacent nodes. The discrete values of hop-count will be converted to more accurate continuous values by our proposed method. Therefore, the error caused by the estimated distance can be effectively reduced. Furthermore, we formulate the location estimation process to be a minimizing optimization problem based on the weighted squared errors of estimated distance. We apply Differential Evolution (DE) algorithm to acquire the global optimum solution which corresponds to the estimated location of unknown nodes. The proposed localization algorithm based on improved DV-Hop and DE is called DECHDV-Hop. We conduct substantial experiments to evaluate the effectiveness of DECHDV-Hop including the comparison with DV Hop, GADV-Hop and PSODV-Hop in four different network simulation situations. Experimental results demonstrate that DECHDV-Hop can achieve much higher localization accuracy than other algorithms in these network situations. (C) 2018 Elsevier B.V. All rights reserved.
机译:本地化技术一直是用于物联网(物联网)的核心组件,特别是对于无线传感器网络(WSN)。在所有本地化技术中,距离矢量跳(DV-HOP)算法是WSN的非常常用的算法。 DV-Hop估计通过跳数值是离散的节点之间的跳数的距离,因此存在严重后果,当它们相对于相同节点的跳数时,某些节点具有相同的估计距离平等的。在本文中,我们通过相邻节点之间的常见单跳节点的数量来改善跳数的值。跳数的离散值将通过我们提出的方法转换为更准确的连续值。因此,可以有效地减少由估计距离引起的误差。此外,我们根据估计距离的加权平方误差制定位置估计过程,以最小化优化问题。我们应用差分演进(de)算法来获取与未知节点的估计位置相对应的全局最佳解决方案。基于改进的DV-Hop和DE的提议定位算法被称为DecHDV-Hop。我们进行了大量实验,以评估Dechdv-hop的有效性,包括与DV Hop,GADV-HOP和PSODV-HOP的比较,在四种不同的网络仿真情况下。实验结果表明,DecHDV-Hop可以在这些网络情况下实现比其他算法更高的定位精度。 (c)2018 Elsevier B.v.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号