An As-Rigid-As-Possible approach to sensor network localization

Lei Zhang, Ligang Liu, Craig Gotsman, Steven J. Gortler

Research output: Contribution to journalArticlepeer-review

51 Scopus citations


We present a novel approach to localization of sensors in a network given a subset of noisy intersensor distances. The algorithm is based on "stitching" together local structures by solving an optimization problem requiring the structures to fit together in an "As-Rigid-As- Possible" manner, hence the name ARAP. The local structures consist of reference "patches" and reference triangles, both obtained from inter-sensor distances. We elaborate on the relationship between the ARAP algorithm and other state-of-the-art algorithms, and provide experimental results demonstrating that ARAP is significantly less sensitive to sparse connectivity and measurement noise. We also show how ARAP may be distributed..

Original languageEnglish (US)
Pages (from-to)1-21
Number of pages21
JournalACM Transactions on Sensor Networks
Issue number4
StatePublished - Jul 1 2010
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications


  • As-Rigid-As-Possible
  • Embedding
  • Localization
  • Sensor networks


Dive into the research topics of 'An As-Rigid-As-Possible approach to sensor network localization'. Together they form a unique fingerprint.

Cite this