Optimizing trajectories of mobile beacons to localize sensor networks

Authors:
Awais Iqbal;Lanjiang Zhou;Manfred Huber;Gergely Záruba
Affiliations:
The University of Texas at Arlington, Arlington, Texas;The University of Texas at Arlington, Arlington, Texas;The University of Texas at Arlington, Arlington, Texas;The University of Texas at Arlington, Arlington, Texas
Venue:
Proceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments
Year:
2010

Citing 8
Cited 0

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Range-free localization schemes for large scale sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Static Path Planning for Mobile Beacons to Localize Sensor Networks

PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Path planning of mobile landmarks for localization in wireless sensor networks

Computer Communications
Sensor network localisation based on sorted RSSI quantisation

International Journal of Ad Hoc and Ubiquitous Computing
A novel backtracking particle filter for pattern matching indoor localization

Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments
Localization methods for a mobile robot in urban environments

IEEE Transactions on Robotics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with localizing nodes in a sensor network. More precisely, we consider the situation where sensor nodes localize themselves off a mobile beacon node traveling over the deployment area. We describe a genetic approach to derive semioptimal paths for a mobile beacon, where the optimal path is defined as the beacon trajectory resulting in the highest overall localization precision for sensor nodes, with certain constraints on path length. For this, we assume that the beacon periodically broadcasts its location. The sensors can extract this location information as well as the signal strength from received packets to estimate their location. In such localization scenarios, the trajectory of the beacon heavily affects the accuracy of location estimate. To evaluate paths, we employ Cramer Rao bounds (CRB) which provide an unbiased evaluation regardless of the location estimation algorithm. A genetic approach is employed to evolve paths toward an optimal trajectory, with a C++ simulator calculating sensor node CRB estimates as the objective function. We provide a description of the approach and provide insights on what the influence of our genetic algorithm is on the accumulative overall localization CRB.