Geometric buildup algorithms for sensor network localization (Q1955353): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58912681, #quickstatements; #temporary_batch_1706298923732 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 17:27, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Geometric buildup algorithms for sensor network localization |
scientific article |
Statements
Geometric buildup algorithms for sensor network localization (English)
0 references
11 June 2013
0 references
Summary: We present a geometric buildup algorithm for solving the sensor network localization problem with either accurate or noisy distance data. The algorithm determines the locations of the sensors, one at a time, by using the distances between the determined sensors and the undetermined ones. Each time, only a small system of distance equations needs to be solved and therefore, in an ideal case when the required distances are available for every sensor to be determined, the computation can be completed in \(n\) steps if \(n\) sensors are to be determined. An algorithm with two buildup phases is also implemented to handle not only noisy but also sparse distance data with for example only a few distant anchors. We show our test results and compare them with other approaches.
0 references