articleJun 1, 2003Closed access

Localization from mere connectivity

University of Missouri · Palo Alto Research Center

Indexed incrossref

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…

Citation impact

1,348
total citations
FWCI
68.70
Percentile
100%
References
14
Citations per year

Authors

4

Topics & keywords

Keywords
  • Computer science
  • Global Positioning System
  • Node (physics)
  • Multidimensional scaling
  • Range (aeronautics)
  • Scaling
  • Algorithm
  • Theoretical computer science
No related works found for this paper.

Funding