By Topic

Extremum tracking in sensor fields with spatio-temporal correlation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

Physical phenomena such as temperature, humidity, and wind velocity often exhibit both spatial and temporal correlation. We consider the problem of tracking the extremum value of a spatio-temporally correlated field using a wireless sensor network. Determining the extremum at the fusion center after making all sensor nodes transmitting their measurements is not energy-efficient because the spatio-temporal correlation of the field is not exploited. We present an optimal centralized algorithm that utilizes the aforementioned correlation to not only minimize the number of transmitting sensors but also ensure low tracking error with respect to the actual extremum. We use recent order statistics bounds in the formulation of the cost function. Since the centralized algorithm has high time complexity, we propose a suboptimal distributed algorithm based on a modified cost function. Our simulations indicate that a small fraction of sensors is often sufficient to track the extremum, and that the centralized algorithm can achieve about 70% energy savings with almost perfect tracking. Furthermore, the performance of the distributed algorithm is comparable to that of the centralized algorithm with up to 25% more energy expenditure.

Published in:

MILITARY COMMUNICATIONS CONFERENCE, 2010 - MILCOM 2010

Date of Conference:

Oct. 31 2010-Nov. 3 2010