Variants of Multidimensional Scaling for Node Localization

  • Authors:
  • Ahmed A. Ahmed;Yi Shang;Hongchi Shi

  • Affiliations:
  • Department of Computer Science University of Missouri-Columbia Columbia, MO 65211;Department of Computer Science University of Missouri-Columbia Columbia, MO 65211;Department of Computer Science University of Missouri-Columbia Columbia, MO 65211

  • Venue:
  • ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently Multidimensional (MDS) has been successfully applied to the problem of node localization in ad-hoc networks, such as wireless sensor networks. The MDS-MAP method uses MDS to compute a local, relative map at each node from the distance or proximity information of its neighboring nodes. Based on the local maps and the locations of a set of anchor nodes with known locations, the absolute positions of unknown nodes in the network can be computed. We investigate several variants of MDS and their effects on the accuracy of localization in wireless sensor networks. We compare metric scaling and non-metric scaling methods, each with several different optimization criteria. Simulation results show that different optimization models of metric scaling achieve comparable localization accuracy and non-metric scaling achieves more accurate results than metric scaling for sparse networks at the expense of higher computational cost.