Date of Award

Summer 2005

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Electrical & Computer Engineering

Program/Concentration

Computer Engineering

Committee Director

Min Song

Committee Member

Vijayan K. Asari

Committee Member

Frederic D. McKenzie

Call Number for Print

Special Collections LD4331.E55 A442 2005

Abstract

In mobile wireless sensor networks, sensors move in the monitored area at any direction and speed. Unlike many other networking hosts, sensor nodes do not have global addresses. They are often identified by using a location-based addressing scheme. Therefore, it is important to have the knowledge of the sensor location indicating where the data came from. In this thesis, three localization update algorithms were designed, Specifically, a sensor movement is divided into three states: Pause, Linear, and Random. Each state adopts different localization update algorithm. Since complex movement involves different mobility patterns, a state transition model is developed to accommodate the transition among the three algorithms. This design is called Mobility-pattern Based Localization Update Algorithm.

Simulation results and analysis are provided to study the localization update cost and location accuracy of the proposed mobility-pattern based design. The simulation is developed to accommodate the three different mobility patterns. The analysis to these results indicates that the localization update cost is minimized and the location accuracy is improved.

Rights

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

DOI

10.25777/1cpr-jr44

Share

COinS