Coverage-Based Information Retrieval for Lifetime Maximization in Sensor Networks

The authors consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. They address sensor scheduling in each data collection under the performance measure of network lifetime. They formulate this problem as an energy constrained coverage problem and proposal a scheduling algorithm based on a greedy approach. In the proposed algorithm, they consider the impact of both the network geometry and the energy consumption by sensors to the network lifetime. Numerical examples are carried out to demonstrate the performance of the proposed algorithm.

Provided by: University of California Topic: Mobility Date Added: Jan 2011 Format: PDF

Find By Topic