针对基于经典多维定标的黔MAP算法在定位精度与矩阵计算复杂度方面的不足,提出一种基于多维定标的迭代定位算法.该算法仅使用节点间的一跳距离,通过新的多维定标的迭代算法进行定位.该算法复杂度不高,理论分析和仿真结果表明,在规则网络中定位误差较小,最优情况下误差可以小于5%,在非规则网络中仍可达到较好的定位精度.
Considering that the MDS-MAP algorithm based on classic multidimensional scaling has shortages on localization precision and complication on matrix computing, we proposed a iterative localization algorithm based on multidimensional scaling(MDS) technique. It adopted a new iterative MDS algorithm for localization just using the one-hop range between neighbor nodes. The algorithm is not complicated. We show by both theoretical analysis and simulations that our algorithm can get low localization errors in regular networks Which is less than 5% in good condition and can get low localization in both irregular networks.