An As-Rigid-As-Possible Approach to Sensor Network Localization

DSpace/Manakin Repository

An As-Rigid-As-Possible Approach to Sensor Network Localization

Citable link to this page

 

 
Title: An As-Rigid-As-Possible Approach to Sensor Network Localization
Author: Zhang, Lei; Liu, Ligang; Gotsman, Craig; Gortler, Steven J.

Note: Order does not necessarily reflect citation order of authors.

Citation: Zhang, Lei, Ligang Liu, Craig Gotsman, and Steven J. Gortler. 2009. An As-Rigid-As-Possible Approach to Sensor Network Localization. Harvard Computer Science Group Technical Report TR-01-09.
Full Text & Related Files:
Abstract: We present a novel approach to localization of sensors in a network given a subset of noisy inter-sensor 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.
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:23017255
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters