Awais Iqbal

Graduation Semester and Year

2008

Language

English

Document Type

Thesis

Degree Name

Master of Science in Computer Engineering

Department

Computer Science and Engineering

First Advisor

Gergely Záruba

Abstract

This work describes a genetic algorithm based approach to approximate an optimal path for a mobile beacon node in a grid of stationary wireless sensors. As the beacon moves over the field of sensors it broadcasts its location. Sensors that are currently in the proximity of the beacon will receive this communication and can then use several of these messages to compute estimates on their locations. An optimal path is defined as a path that will result in the highest overall precision of location estimates among sensors given a maximum path length for the beacon. We assume that sensors are uniformly deployed in a predefined deployment area. We evaluate location precision calculating the maximum achievable accuracy using Cramer Rao Bound (CRB) for unbiased evaluation.Paths are described as strings and multiple genetic operators including mutation, splicing, selection and cross-over are used to create new paths which are evaluated for precision. Details of the genetic optimization approach to find optimal path lengths are given; then extensive simulations are performed in order to look for paths resulting in high precision. We describe optimal paths as well as look at the relationship of maximum path length versus precision of overall estimates.

Disciplines

Computer Sciences | Physical Sciences and Mathematics

Comments

Degree granted by The University of Texas at Arlington

Download

Share

COinS