最优的网络内报文聚合策略,以获得最大的信息新鲜度

A. S. Akyurek, T. Simunic
{"title":"最优的网络内报文聚合策略,以获得最大的信息新鲜度","authors":"A. S. Akyurek, T. Simunic","doi":"10.1109/EuCNC.2016.7561011","DOIUrl":null,"url":null,"abstract":"The Internet of Things is emerging as more wireless sensor networks get deployed every day, pushing decision making and processing towards the edge onto more constrained devices. In these constrained networks, using a single packet to transmit small sensed data is an inefficient use of both bandwidth and energy. Aggregating multiple measurements and packets into a single packet increases efficiency and resource utilization, but it also introduces the problem of deciding when to transmit aggregated data. In this work, we show theoretically that the classical performance metrics of energy consumption and expiration rate create a balanced tradeoff, where their combined metric of energy consumption per non-expired measurement is a constant, independent of policy selection. We introduce a new metric, information freshness, and derive an optimal policy to maximize it under both single hop and multi-hop cases. We provide a distributed algorithm to implement our optimal policy. Our case studies show that our algorithm outperforms state-of-the-art policies by more than 3.3x for information freshness and reduces energy consumption by more than 62%.","PeriodicalId":416277,"journal":{"name":"2016 European Conference on Networks and Communications (EuCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Optimal in-network packet aggregation policy for maximum information freshness\",\"authors\":\"A. S. Akyurek, T. Simunic\",\"doi\":\"10.1109/EuCNC.2016.7561011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Internet of Things is emerging as more wireless sensor networks get deployed every day, pushing decision making and processing towards the edge onto more constrained devices. In these constrained networks, using a single packet to transmit small sensed data is an inefficient use of both bandwidth and energy. Aggregating multiple measurements and packets into a single packet increases efficiency and resource utilization, but it also introduces the problem of deciding when to transmit aggregated data. In this work, we show theoretically that the classical performance metrics of energy consumption and expiration rate create a balanced tradeoff, where their combined metric of energy consumption per non-expired measurement is a constant, independent of policy selection. We introduce a new metric, information freshness, and derive an optimal policy to maximize it under both single hop and multi-hop cases. We provide a distributed algorithm to implement our optimal policy. Our case studies show that our algorithm outperforms state-of-the-art policies by more than 3.3x for information freshness and reduces energy consumption by more than 62%.\",\"PeriodicalId\":416277,\"journal\":{\"name\":\"2016 European Conference on Networks and Communications (EuCNC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 European Conference on Networks and Communications (EuCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EuCNC.2016.7561011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 European Conference on Networks and Communications (EuCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EuCNC.2016.7561011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

随着每天部署越来越多的无线传感器网络,物联网正在兴起,将决策和处理推向边缘,并将其转移到更多受限的设备上。在这些受约束的网络中,使用单个数据包传输小的感测数据是对带宽和能量的低效使用。将多个测量值和数据包聚合到单个数据包中可以提高效率和资源利用率,但也会引入决定何时传输聚合数据的问题。在这项工作中,我们从理论上表明,能源消耗和到期率的经典性能指标创造了一个平衡的权衡,其中每个未到期测量的能源消耗的组合度量是一个常数,独立于政策选择。我们引入了一个新的度量,信息新鲜度,并推导了在单跳和多跳情况下最大化信息新鲜度的最优策略。我们提供了一个分布式算法来实现我们的最优策略。我们的案例研究表明,我们的算法在信息新鲜度方面比最先进的策略高出3.3倍以上,并将能耗降低62%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal in-network packet aggregation policy for maximum information freshness
The Internet of Things is emerging as more wireless sensor networks get deployed every day, pushing decision making and processing towards the edge onto more constrained devices. In these constrained networks, using a single packet to transmit small sensed data is an inefficient use of both bandwidth and energy. Aggregating multiple measurements and packets into a single packet increases efficiency and resource utilization, but it also introduces the problem of deciding when to transmit aggregated data. In this work, we show theoretically that the classical performance metrics of energy consumption and expiration rate create a balanced tradeoff, where their combined metric of energy consumption per non-expired measurement is a constant, independent of policy selection. We introduce a new metric, information freshness, and derive an optimal policy to maximize it under both single hop and multi-hop cases. We provide a distributed algorithm to implement our optimal policy. Our case studies show that our algorithm outperforms state-of-the-art policies by more than 3.3x for information freshness and reduces energy consumption by more than 62%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信