传感技术学报2016，Vol.29Issue(1)：129-135,7.DOI:10.3969/j.issn.1004-1699.2016.01.022
最短路径距离矩阵修正的多维标度定位算法
Multidimensional Scaling Localization Algorithm Based on the Shortest Path Matrix Correction
任克强 1庄放望1
作者信息
- 1. 江西理工大学信息工程学院,江西赣州341000
- 折叠
摘要
Abstract
In order to reduce the difference between the shortest path distance matrix and Euclidean distance ma-trix,an improved algorithm of multidimensional scaling node localization was proposed to enhance the node localiza-tion accuracy of MDS-MAP(C)algorithm. The algorithm made some improvements on MDS-MAP(C)algorithm. The shortest path distance matrix was corrected by using heuristic search strategy,so as to reduce the error between the shortest path distance matrix and the actual Euclidean distance matrix. Then smacof algorithm iterative error func-tion instead of singular value decomposition(SVD)was utilized to solve the problem of node localization,which could optimize and improve the solving process of node localization. The experimental results show that compared with MDS-MAP(C)algorithm,the improved algorithm can reduce the error of the shortest path distance,effectively improve the node localization accuracy,and it has better adaptability to the irregular network.关键词
无线传感器网络/最短路径/MDS-MAP(C)算法/节点定位/多维标度/smacof算法Key words
wireless sensor network/the shortest path/MDS-MAP(C)algorithm/node localization/multidimension?al scaling/smacof algorithm分类
信息技术与安全科学引用本文复制引用
任克强,庄放望..最短路径距离矩阵修正的多维标度定位算法[J].传感技术学报,2016,29(1):129-135,7.
