DV-Hop localization algorithm has greater localization error which estimates distance from an unknown node to the different anchor nodes by using estimated average size of a hop to achieve the location of the unknown ...DV-Hop localization algorithm has greater localization error which estimates distance from an unknown node to the different anchor nodes by using estimated average size of a hop to achieve the location of the unknown node.So an improved DV-Hop localization algorithm based on correctional average size of a hop,HDCDV-Hop algorithm,is proposed.The improved algorithm corrects the estimated distance between the unknown node and different anchor nodes based on fractional hop count information and relatively accurate coordinates of the anchor nodes information,and it uses the improved Differential Evolution algorithm to get the estimate location of unknown nodes so as to further reduce the localization error.Simulation results show that our proposed algorithm have lower localization error and higher localization accuracy compared with the original DV-Hop algorithm and other classical improved algorithms.展开更多
为提升DV-Hop(distance vector-hop)算法定位精度水平,提出一种基于割圆术的DV-Hop全局优化(circle-cutting technique for global optimization of DV-Hop algorithm,CTGO-DV-Hop)算法。该算法精确了最小跳数,引入权值模型对全部锚节...为提升DV-Hop(distance vector-hop)算法定位精度水平,提出一种基于割圆术的DV-Hop全局优化(circle-cutting technique for global optimization of DV-Hop algorithm,CTGO-DV-Hop)算法。该算法精确了最小跳数,引入权值模型对全部锚节点的平均单跳距离进行优化,并采用加权最小二乘递推算法对未知节点坐标进行拟合。实验测试多种因素对于算法的影响,结果表明,所提出的CTGO-DV-Hop算法表现出良好的性能,相较于DV-Hop、OCSLC-DV-Hop和WOCS-DV-Hop,平均定位误差的最大降幅为70%左右,适用于构建节点数目大、锚节点比例低的无线传感器网络系统。展开更多
In this paper, the self-localization problem is studied. It is one of the key technologies in wireless sensor networks (WSNs). And five localization algorithms: Centroid algorithm, Amorphous algorithm, DV-hop algorith...In this paper, the self-localization problem is studied. It is one of the key technologies in wireless sensor networks (WSNs). And five localization algorithms: Centroid algorithm, Amorphous algorithm, DV-hop algorithm, APIT algorithm and Bounding Box algorithm are discussed. Simulation of those five localization algorithms is done by MATLAB. The simulation results show that the positioning error of Amorphous algorithm is the minimum. Considering economy and localization accuracy, the Amorphous algorithm can achieve the best localization performance under certain conditions.展开更多
基金supported by Fundamental Research Funds of Jilin University(No.SXGJQY2017-9,No.2017TD-19)the National Natural Science Foundation of China(No.61771219)
文摘DV-Hop localization algorithm has greater localization error which estimates distance from an unknown node to the different anchor nodes by using estimated average size of a hop to achieve the location of the unknown node.So an improved DV-Hop localization algorithm based on correctional average size of a hop,HDCDV-Hop algorithm,is proposed.The improved algorithm corrects the estimated distance between the unknown node and different anchor nodes based on fractional hop count information and relatively accurate coordinates of the anchor nodes information,and it uses the improved Differential Evolution algorithm to get the estimate location of unknown nodes so as to further reduce the localization error.Simulation results show that our proposed algorithm have lower localization error and higher localization accuracy compared with the original DV-Hop algorithm and other classical improved algorithms.
文摘为提升DV-Hop(distance vector-hop)算法定位精度水平,提出一种基于割圆术的DV-Hop全局优化(circle-cutting technique for global optimization of DV-Hop algorithm,CTGO-DV-Hop)算法。该算法精确了最小跳数,引入权值模型对全部锚节点的平均单跳距离进行优化,并采用加权最小二乘递推算法对未知节点坐标进行拟合。实验测试多种因素对于算法的影响,结果表明,所提出的CTGO-DV-Hop算法表现出良好的性能,相较于DV-Hop、OCSLC-DV-Hop和WOCS-DV-Hop,平均定位误差的最大降幅为70%左右,适用于构建节点数目大、锚节点比例低的无线传感器网络系统。
文摘In this paper, the self-localization problem is studied. It is one of the key technologies in wireless sensor networks (WSNs). And five localization algorithms: Centroid algorithm, Amorphous algorithm, DV-hop algorithm, APIT algorithm and Bounding Box algorithm are discussed. Simulation of those five localization algorithms is done by MATLAB. The simulation results show that the positioning error of Amorphous algorithm is the minimum. Considering economy and localization accuracy, the Amorphous algorithm can achieve the best localization performance under certain conditions.