Wireless sensor networks has been rapidly growing over the past few decades. It has its significance in many fields (e.g., recording temperature in an area, data collecting, health care monitoring etc.). One such application is tracking a target with the use of sensor networks. The problem arises when the mobile target is not following the path that is predicted. In this paper, we consider the problem of both navigation and tracking of a mobile target using Ad-Hoc On-demand Distance Vector Protocol (AODV). For this model, we propose a new approach called extended min max approximation to detect the position of the target and navigation simultaneously. In addition to it, we use semi definite programming relaxation which helps in solving this problem effectively. We here use AODV routing protocol instead of Dynamic Source Routing (DSR) and a cubic function is used to navigate the mobile sensors effectively.
|Commitee:||Ary, James, Sodagari, Shabnam|
|School:||California State University, Long Beach|
|School Location:||United States -- California|
|Source:||MAI 55/02M(E), Masters Abstracts International|
|Subjects:||Communication, Electrical engineering|
|Keywords:||Min max approximation, Target tracking, Wireless sensors|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be