Splitting the Linear Least Squares Problem for Precise Localization in Geosensor Networks

Autor: Reichenbach, F.; Born, A.; Timmermann, D.; Bill, R.
In:

Geographic Information Science - Fourth International Conference, GIScience 2006
Lecture Notes in Computer Science 4197
Ort: GIScience 2006, Münster, Deutschland
Verlag: Springer, Berlin
ISBN: 3-540-44526-9
Seite: 331 - 337
Jahr: 2006

Einordung:
Institut: Professur Geodäsie und Geoinformatik

Abstract:
Localizing sensor nodes is essential due to their random distribution after deployment. To reach a long network lifetime, which strongly depends on the limited energy resources of every node, applied algorithms must be developed with an awareness of computation and communication cost. In this paper we present a new localization method, which places a minimum computational requirement on the nodes but achieves very low localization errors of less than 1%. To achieve this, we split the complex least squares method into a less central precalculation and a simple, distributed subcalculation. This allows precalculating the complex part on high-performance nodes, e.g. base stations. Next, sensor nodes estimate their own positions by simple subcalculation, which does not exhaust the limited resources. We analyzed our method with three commonly used numerical techniques - normal equations, qr-factorization, and singular-value decomposition. Simulation results showed that we reduced the complexity on every node by more than 47% for normal equations. In addition, the proposed algorithm is robust with respect to high input errors and has low communication and memory requirements.

Ansprechpartner

Weitere Information im WWW

Zur Publikation: Mitarbeiter, Projekte
Weitere Publikationen im Forschungsteilschwerpunkt