Optimal Schedules for Sensor Network Queries

S. Gopalakrishnan
{"title":"Optimal Schedules for Sensor Network Queries","authors":"S. Gopalakrishnan","doi":"10.1109/RTSS.2010.37","DOIUrl":null,"url":null,"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.","PeriodicalId":202891,"journal":{"name":"2010 31st IEEE Real-Time Systems Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 31st IEEE Real-Time Systems Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTSS.2010.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

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.
传感器网络查询的最优调度
我们研究了当能源效率和数据新鲜度需要平衡时查询传感器网络的最佳策略。我们使用关于传感器网络监测的事件性质的统计信息来制定良好的查询调度。对于泊松事件到达,我们开发了一个最优调度策略,它实际上是一个周期性查询策略。对于事件间隔到达时间的超指数分布,讨论了一种最优策略,并由于最优方案的计算成本较高,提出了次最优方案。我们将传感器网络视为一个黑盒子,它具有与各种操作相关的(主要是能源)成本,并建议这确实是可行的,因为我们讨论的用于调度查询的高级策略可以很容易地实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信