一种基于顺序多维定标的无锚点定位算法的研究

Study on an anchor-free localization algorithm based on ordinal multidimensional scaling

针对经典多维定标无锚点定位(MDS(C))算法在节点定位精度方面的不足,提出了一种基于顺序多维定标的无锚点定位(MDS(O))算法。该算法假定节点对之间的最短路径距离和欧氏距离存在单调性关系,避免了MDS(C)中节点对之间的最短路径距离和欧氏距离线性关系难以确定的缺陷。理论分析和仿真结果表明:MDS(O)能够提高平均定位精度1.04%～38.2%,有效地实现了节点定位。

Aiming at the shortages of localization precision on classic multidimensional scaling anchor-free localization algorithm which is called MDS（C）,a new anchor-free localization algorithm called MDS（O）for short,based on ordinal multidimensional scaling is proposed.The algorithm assumes that monotonicity constraint between the shortest path and the Euclidean distance for each pair of nodes,which avoids the difficulties of determining the linearity between the shortest path and the Euclidean distance for each pair of nodes in MDS（C）.Through theoretical analysis and simulations,algorithm provides a lower localization error than classical MDS（C）algorithm.The localization precision is improved 1.04 % ~38.2 %,and the node localization is realized effectively.