基于DV-Hop和距离几何约束的定位算法

A Localization Algorithm Based on DV-Hop and Distance Geometry Constraints

针对DV-Hop定位算法的误差主要是计算未知节点和信标节点间距离的问题,利用二维空间的Cayley-Menger行列式提供的几何约束对未知节点到信标节点的距离进行优化修正.通过距离几何约束的条件对未知节点到信标节点之间的测量值进行处理,来减少未知节点到信标节点的测距误差,并采用三边测量法进行定位.仿真实验结果表明,随着信标节点数目的增加,用于校正的测量数据增加,该定位算法能够更加准确地测量未知节点和信标节点间的距离,提高网络节点的定位精度,同时使节点的覆盖率有了较大提高.

The error in the DV-Hop localization algorithm is primarily in computing the distance between unknown and anchor nodes.Using distance geometry constraints and the Cayley-Menger determinant in two-dimensional space,the distance between unknown and anchor nodes were optimized and corrected.The conditions of distance geometry constraints successfully reduced the error of distance measurements between unknown and anchor nodes,and node localization was determined using trilateration.Simulation results show that the measurement data needing correction increases with the number of anchor nodes,and that this localization algorithm accurately measures the distance between unknown and anchor nodes,thereby improving positioning accuracy of network nodes and greatly increasing the coverage rate of nodes.