.png){kind=icon}
.png){kind=icon}
Return
An As-Rigid-As-Possible Approach to Sensor Network Localization
.png){kind=icon}
OA
AI
DOI：10.1145/1777406.1777414.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Algorithms
Performance
Sensor networks
as-rigid-as-possible
localization
embedding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.7
Papers:
995
Citations:
2.0K
Organization
View more organizations