首页> 中文期刊> 《计算机应用与软件》 >量子粒子群算法在WSN三维定位中的研究

量子粒子群算法在WSN三维定位中的研究

         

摘要

3D-DVHoP as a classic three-dimensional localization algorithm, when the uneven distribution of nodes due to "winding"phenomenon leading to a large deviation.In order to find the minimum error between the actual distance and estimated distance of neighbor nodes and improve the localization accuracy, the existing improved algorithms are easy to fall into the local optimum or no solution.The new algorithm introduces the quantum rotation gate variation rule based on 3D-DVHoP.Modifying the individual particle rate and state by crossover mutation, we can increase the universality and ergodicity of particle search to find the global optimal solution.The simulation results show that the new algorithm can avoid the problem that the existing improved algorithms are easy to fall into the local optimum and has higher localization accuracy.%3D-DVHoP作为三维定位的经典算法,会因节点分布不均时,因"绕弯"现象导致较大偏差.为找出邻居节点之间的实际距离与绕弯距离最小误差,提高定位精度,已有的改进算法容易陷入局部最优或无解现象.新算法在3D-DVHoP基础上引入量子旋转门变异规则,通过交叉变异修正个体粒子速率和状态,增加粒子搜索的广泛性和遍历性,从而找出全局最优解.仿真实验证明,该算法可以有效避免已有的改进算法容易陷入局部最优的问题,拥有更高的定位精度.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号