一种基于OLPDV-Hop的无线传感器网络节点定位算法  

A Wireless Sensor Network Node Location Algorithm Based on OLPDV-Hop

作　　者：于瑞萍[1] 张明[2] YU Rui-ping;ZHANG Ming(Rizhao Traditional Chinese Hospital, Rizhao 276800 China;Rizhao Polytechnic, Rizhao 276800 China)

机构地区：[1]日照市中医医院,山东日照276800 [2]日照职业技术学院,山东日照276800

出　　处：《自动化技术与应用》2019年第9期84-87,共4页Techniques of Automation and Applications

摘　　要：为了提高DV-Hop(Distance Vector-Hop)算法中无线传感器网络节点定位精度,提出一种基于OLPDV-Hop(Optimal Jump Distance and Levy Particle Swarm Optimization DV-Hop)的节点定位算法,对OLPDV-Hop算法选择Windows7的MATLABR2014a系统环境依次对比了DV-Hop、BDV-Hop与IPSODV-Hop三种算法比较。在节点总数等于100、锚节点数占比为20%以及25~50m通信半径范围内,算法平均定位误差都发生了减小的情况,之后开始重新升高。四种算法都发生了平均定位误差不断降低的现象,当锚节点的密度上升后,相互间的跳数将会变小,并且OLPDV-Hop算法达到最小的平均定位误差。In order to improve the localization accuracy of wireless sensor network nodes in the Distance vector-hop algorithm, a node localization algorithm based on olpdv-hop (Optimal Jump Distance and Levy Particle Swarm Optimization dv-hop) is proposed. The MATLABR2014a system environment of Windows7 selected by olpdv-hop algorithm is compared successively with the three algorithms of dv-hop, bdv-hop and ipsodv-hop. When the total number of nodes is equal to 100, the proportion of anchor nodes is 20%, and the communication radius is 25~50m, the average positioning error of the algorithm decreases, and then starts to rise again. All the four algorithms have the phenomenon that the average positioning error keeps decreasing. When the density of anchor nodes increases, the number of jumps between them decreases, and olpdv- hop algorithm reaches the minimum average positioning error.

关 键 词：无线传感器网络 最优跳距 最小跳数 DV-HOP 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]