By Topic

Optimal Schedules for Sensor Network Queries

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

1 Author(s)
Gopalakrishnan, S. ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada

We examine optimal strategies for querying a sensor network when energy efficiency and data freshness need to be balanced. We use statistical information about the nature of events monitored by the sensor network to develop good query schedules. For Poisson event arrivals, we develop an optimal scheduling strategy that is actually a periodic querying policy. For hyper exponential distribution of event inter-arrival times, we discuss an optimal policy, and suggest sub optimal schemes because of the high computational cost imposed by the optimal scheme. We treat the sensor network like a black box that has (primarily energy) costs associated with various operations and suggest that this is indeed feasible, as a consequence the higher-level policies that we discuss for scheduling queries can be realized easily.

Published in:

Real-Time Systems Symposium (RTSS), 2010 IEEE 31st

Date of Conference:

Nov. 30 2010-Dec. 3 2010