Skip to main content
Article
Licensed
Unlicensed Requires Authentication

Precise Positioning with a Low Complexity Algorithm in Ad hoc Wireless Sensor Networks

  • , and
Published/Copyright: December 14, 2007
Become an author with De Gruyter Brill
PIK - Praxis der Informationsverarbeitung und Kommunikation
From the journal Volume 28 Issue 2

ABSTRACT

Nodes in a sensor network are often randomly distributed. To assign measurements to locations, each node has to determine its own position. Due to limited resources of the nodes, resource-aware positioning algorithms are required.

In this paper, we present the novel “Weighted Centroid Localization” algorithm (WCL). Compared to other approximative algorithms, WCL achieves a remarkable average positioning error below 6%. Moreover, the algorithm features simple implementation and scales well in large sensor networks. In contrast to exact algorithms using analytical equations and complex matrix operations, WCL requires only a very small memory footprint.

Published Online: 2007-12-14
Published in Print: 2005-June-20

© Copyright by K.G. Saur Verlag 2005

Downloaded on 16.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/PIKO.2005.80/html
Scroll to top button