Title
Optimal Schedules for Sensor Network Queries
Abstract
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.
Year
DOI
Venue
2010
10.1109/RTSS.2010.37
Real-Time Systems Symposium
Keywords
Field
DocType
sub optimal scheme,optimal scheme,higher-level policy,optimal schedules,optimal scheduling strategy,sensor network queries,sensor network,optimal strategy,optimal policy,event inter-arrival time,energy efficiency,poisson event arrival,black box,sensors,scheduling,schedules,exponential distribution,wireless sensor networks,energy efficient,random variables
Black box (phreaking),Mathematical optimization,Efficient energy use,Scheduling (computing),Computer science,Real-time computing,Schedule,Exponential distribution,Hyperexponential distribution,Wireless sensor network,Energy consumption,Distributed computing
Conference
ISSN
ISBN
Citations 
1052-8725
978-0-7695-4298-0
3
PageRank 
References 
Authors
0.40
19
1
Name
Order
Citations
PageRank
Sathish Gopalakrishnan142633.10