A distributed linear least squares method for precise localization with low complexity in wireless sensor networks

  • Authors:

  • Frank Reichenbach;Alexander Born;Dirk Timmermann;Ralf Bill

  • Affiliations:

  • Institute of Applied Microelectronics and Computer Engineering, University of Rostock, Germany;Institute for Geodesy and Geoinformatics, University of Rostock, Germany;Institute of Applied Microelectronics and Computer Engineering, University of Rostock, Germany;Institute for Geodesy and Geoinformatics, University of Rostock, Germany

  • Venue:
  • DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.