基于改进粒子群算法无线传感器网络节点定位.docVIP

  • 6
  • 0
  • 约1万字
  • 约 16页
  • 2018-08-29 发布于福建
  • 举报

基于改进粒子群算法无线传感器网络节点定位.doc

基于改进粒子群算法无线传感器网络节点定位

基于改进粒子群算法无线传感器网络节点定位   摘要:针对传统距离矢量跳数(DVHop)算法中最小二乘法的估计误差过大、粒子群(PSO)算法易陷入局部最优的问题,提出了一种改进粒子群算法与DVHop的融合算法。首先从粒子速度、惯性权重、学习策略、变异方面对粒子群算法进行改进,增强算法跳出局部最优的能力,提高迭代后期算法的搜索速度;然后在DVHop算法第三阶段采用改进粒子群算法优化节点的定位结果。仿真结果表明:相比传统DVHop算法、基于混沌粒子群算法的DVHop改进算法(MPSO1DVHop)和基于改进型粒子群优化的DVHop算法(MPSO2DVHop),该算法的定位精度高,稳定性好,适用于定位精度和稳定性要求较高的场景。   关键词:无线传感器网络;粒子群算法;距离矢量跳数算法;惯性权重;变异   中图分类号: TP393 文献标志码:A   英文摘要   Abstract:The estimation error of the least square method in traditional Distance VectorHop (DVHop) algorithm is too large and the Particle Swarm Optimization (PSO) algorithm easily traps into local optimum. In order to overcome the problems, a fusion algorithm of improved particle swarm algorithm and DVHop algorithm was presented. First of all, PSO algorithm was improved from aspects of particle velocity, inertia weight, learning strategy and variation, which enhanced the ability of algorithm to jump out of local optimum and increased the search speed of the algorithm in later iterative stage. The node localization result was optimized by using the improved PSO algorithm in the third stage of the DVHop algorithm. The simulation results show that compared with the traditional DVHop algorithm,the improved DVHop based on chaotic PSO algorithm, and the DVHop algorithm based on improved PSO, the proposed algorithm has high positioning accuracy, good stability. which is suitable for scenes which require high locating accuracy and good stability.   英文关键词   Key words:Wireless Sensor Network (WSN); Particle Swarm Optimization (PSO) algorithm; Distance VectorHop (DVHop)algorithm; inertia weight; variation   0 引言   定位是无线传感器网络(Wireless Sensor Network, WSN)重要的支撑技术,并有广泛的应用[1]。针对无线传感器网络节点定位问题,国内外学者进行了大量研究,主要有基于测距和免测距两类传感器节点定位算法[2]。免测距定位算法主要包括质心算法[3]、距离矢量跳数(Distance VectorHop, DVHop)算法[4]、无定形(Amorphous)算法[5]、多维标度规划(Multidimensional ScalingMap, MDSMAP)算法[6],由于其在硬件要求、网络部署成本、能耗等方面的优势,相对来说更适合于无线传感器网络[7]。其中DVHop算法巧妙地将节点间的距离测量转化为跳数与平均跳距的乘积,是目前研究最广泛的算法之一[8]。   DVHop算法可分为三个阶段,在第一、第二阶段利用跳数和平均跳距得到未知节点到锚节

文档评论(0)

1亿VIP精品文档

相关文档