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 %

3

8.2 %

and the node localization is realized effectively.