Localization from mere connectivity

  • Authors:

  • Yi Shang;Wheeler Ruml;Ying Zhang;Markus P. J. Fromherz

  • Affiliations:

  • University of Missouri, Columbia, MO;Palo Alto Research Center, Palo Alto, CA;Palo Alto Research Center, Palo Alto, CA;Palo Alto Research Center, Palo Alto, CA

  • Venue:
  • Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. We present an algorithm that uses connectivity information who is within communications range of whom to derive the locations of the nodes in the network. The method can take advantage of additional information, such as estimated distances between neighbors or known positions for certain anchor nodes, if it is available. The algorithm is based on multidimensional scaling, a data analysis technique that takes O(n3) time for a network of n nodes. Through simulation studies, we demonstrate that the algorithm is more robust to measurement error than previous proposals, especially when nodes are positioned relatively uniformly throughout the plane. Furthermore, it can achieve comparable results using many fewer anchor nodes than previous methods, and even yields relative coordinates when no anchor nodes are available.