Date of Award

8-5-2009

Degree Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

Department

Computer Science

First Advisor

Sushil K. Prasad - Committee Chair

Second Advisor

Rajshekhar Sunderraman - Committee Member

Third Advisor

Shamkant B. Navathe - Committee Member

Fourth Advisor

Yingshu Li - Committee Member

Abstract

Wireless sensor networks (WSNs) are emerging as a key enabling technology for applications domains such as military, homeland security, and environment. However, a major constraint of these sensors is their limited battery. In this dissertation we examine the problem of maximizing the duration of time for which the network meets its coverage objective. Since these networks are very dense, only a subset of sensors need to be in "sense" or "on" mode at any given time to meet the coverage objective, while others can go into a power conserving "sleep" mode. This active set of sensors is known as a cover. The lifetime of the network can be extended by shuffling the cover set over time. In this dissertation, we introduce the concept of a local lifetime dependency graph consisting of the cover sets as nodes with any two nodes connected if the corresponding covers intersect, to capture the interdependencies among the covers. We present heuristics based on some simple properties of this graph and show how they improve over existing algorithms. We also present heuristics based on other properties of this graph, new models for dealing with the solution space and a generalization of our approach to other graph problems.

DOI

https://doi.org/10.57709/1346404

Download

Share

COinS