Date of Award

5-22-2006

Degree Type

Thesis

Degree Name

M.S.

Degree Program

Computer Science

Department

Computer Science

Major Professor

Deng, Jing

Second Advisor

Roussev, Vassil

Third Advisor

Chen, Yixin

Abstract

The Hot Spot effect is an issue that reduces the network lifetime considerably. The network on the field forms a tree structure in which the sink represents the root and the furthest nodes in the perimeter represent the leaves. Each node collects information from the environment and transmits data packets to a "reachable" node towards the sink in a multi-hop fashion. The closest nodes to the sink not only transmit their own packets but also the packets that they receive from "lower" nodes and therefore exhaust their energy reserves and die faster than the rest of the network sensors. We propose a technique to allow the data sink to identify nodes severely suffering from the Hot Spot effect and to move beyond these nodes. We will explore the best trajectory that the data sink should follow. Performance results are presented to support our claim of superiority for our scheme.

Rights

The University of New Orleans and its agents retain the non-exclusive license to archive and make accessible this dissertation or thesis in whole or in part in all forms of media, now or hereafter known. The author retains all other ownership rights to the copyright of the thesis or dissertation.

Share

COinS