首页> 外文期刊>Sensors >A Novel Centralized Range-Free Static Node Localization Algorithm with Memetic Algorithm and Lévy Flight
【24h】

A Novel Centralized Range-Free Static Node Localization Algorithm with Memetic Algorithm and Lévy Flight

机译:一种新型集中式无距离静态节点定位算法,综合算法和levy飞行

获取原文
           

摘要

Node localization, which is formulated as an unconstrained NP-hard optimization problem, is considered as one of the most significant issues of wireless sensor networks (WSNs). Recently, many swarm intelligent algorithms (SIAs) were applied to solve this problem. This study aimed to determine node location with high precision by SIA and presented a new localization algorithm named LMQPDV-hop. In LMQPDV-hop, an improved DV-Hop was employed as an underground mechanism to gather the estimation distance, in which the average hop distance was modified by a defined weight to reduce the distance errors among nodes. Furthermore, an efficient quantum-behaved particle swarm optimization algorithm (QPSO), named LMQPSO, was developed to find the best coordinates of unknown nodes. In LMQPSO, the memetic algorithm (MA) and Lévy flight were introduced into QPSO to enhance the global searching ability and a new fast local search rule was designed to speed up the convergence. Extensive simulations were conducted on different WSN deployment scenarios to evaluate the performance of the new algorithm and the results show that the new algorithm can effectively improve position precision.
机译:将其作为无约束NP-Hard优化问题的节点本地化被认为是无线传感器网络(WSN)最重要的问题之一。最近,应用了许多群体智能算法(SIAS)来解决这个问题。本研究旨在通过SIA确定具有高精度的节点位置,并呈现了名为LMQPDV-Hop的新定位算法。在LMQPDV-HOP中,采用改进的DV跳作为地下机制来收集估计距离,其中通过定义的权重修改平均跳距来减少节点之间的距离误差。此外,开发了一种名为LMQPSO的有效量子表现粒子群优化优化算法(QPSO),以找到未知节点的最佳坐标。在LMQPSO中,将麦克算法(MA)和Lévy航班引入QPSO中,以增强全球搜索能力,旨在加快汇聚来加快新的本地搜索规则。在不同的WSN部署方案上进行了广泛的仿真,以评估新算法的性能,结果表明,新算法可以有效地提高位置精度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号