An Efficient Directed Localization Recursion Protocol for Wireless Sensor Networks

Authors:
Horacio Antonio Braga Fernandes de Oliveira;Azzedine Boukerche;Eduardo Freire Nakamura;Antonio Alfredo Ferreira Loureiro
Affiliations:
University of Ottawa, Ottawa;University of Ottawa, Ottawa;Federal University of Amazonas and FUCAPI, Brazil;Federal University of Minas Gerais, Brazil
Venue:
IEEE Transactions on Computers
Year:
2009

Citing 0
Cited 4

On the performance of target tracking algorithms using actual localization systems for wireless sensor networks

Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
LICA: robust localization using cluster analysis to improve GPS coordinates

Proceedings of the first ACM international symposium on Design and analysis of intelligent vehicular networks and applications
A multicast reprogramming protocol for wireless sensor networks based on small world concepts

Journal of Parallel and Distributed Computing
Location error estimation in wireless ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	14.98

Visualization

Abstract

The establishment of a localization system is an important task in wireless sensor networks. Due to the geographical correlation between sensed data, location information is commonly used to name the gathered data and address nodes and regions in data dissemination protocols. In general, to estimate its location, a node needs the position information of at least three reference points (neighbors that know their positions). In this work, we propose a different scheme in which only two reference points are required in order to estimate a position. To choose between the two possible solutions of an estimate, we use the known direction of the recursion. This approach leads to a recursive localization system that works with low-density networks (increasing by 40 percent the number of nodes with estimates in some cases), reduces the position error by almost 30 percent, requires 37 percent less processor resources to estimate a position, uses fewer beacon nodes, and also indicates the node position error based on its distance to the recursion origin. No GPS-enabled node is required, since the recursion origin can be used as a relative coordinate system. The algorithm's evaluation is performed by comparing it with a similar localization system; also, experiments are made to evaluate the impact of both systems in geographic algorithms.