Jump to ContentJump to Main Navigation
Show Summary Details
Volume 28, Issue 2

Issues

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

J. Blumenthal / F. Reichenbach / D. Timmermann
Published Online: 2007-12-14 | DOI: https://doi.org/10.1515/PIKO.2005.80

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.

About the article

Published Online: 2007-12-14

Published in Print: 2005-06-20


Citation Information: Praxis der Informationsverarbeitung und Kommunikation, Volume 28, Issue 2, Pages 80–85, ISSN (Print) 0930-5157, DOI: https://doi.org/10.1515/PIKO.2005.80.

Export Citation

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
Imen Mahjri, Samir Medjiah, Amine Dhraief, Khalil Drira, and Abdelfettah Belghith
Internet Technology Letters, 2017, Page e12
[2]
Amanpreet Kaur, Padam Kumar, and Govind P. Gupta
Journal of King Saud University - Computer and Information Sciences, 2017

Comments (0)

Please log in or register to comment.
Log in