能量收集物联网网络中渐近最优按需AoI最小化

Mohammad Hatami, Markus Leinonen, Zheng Chen, Nikolaos Pappas, M. Codreanu
{"title":"能量收集物联网网络中渐近最优按需AoI最小化","authors":"Mohammad Hatami, Markus Leinonen, Zheng Chen, Nikolaos Pappas, M. Codreanu","doi":"10.1109/ISIT50566.2022.9834773","DOIUrl":null,"url":null,"abstract":"We consider a resource-constrained IoT network, where users make on-demand requests to a cache-enabled edge node to send status updates about various random processes, each monitored by an energy harvesting sensor. The edge node serves users’ requests by either commanding the corresponding sensor to send a fresh status update or retrieving the most recently received measurement from the cache. We aim to find a control policy at the edge node to minimize the average age of information (AoI) of the received measurements upon requests, i.e., average on-demand AoI, subject to per-slot transmission and energy constraints. We develop a low-complexity algorithm – termed relax-then-truncate – and prove that it is asymptotically optimal as the number of sensors goes to infinity. Numerical results assess the performance of the proposed method.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Asymptotically Optimal On-Demand AoI Minimization in Energy Harvesting IoT Networks\",\"authors\":\"Mohammad Hatami, Markus Leinonen, Zheng Chen, Nikolaos Pappas, M. Codreanu\",\"doi\":\"10.1109/ISIT50566.2022.9834773\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a resource-constrained IoT network, where users make on-demand requests to a cache-enabled edge node to send status updates about various random processes, each monitored by an energy harvesting sensor. The edge node serves users’ requests by either commanding the corresponding sensor to send a fresh status update or retrieving the most recently received measurement from the cache. We aim to find a control policy at the edge node to minimize the average age of information (AoI) of the received measurements upon requests, i.e., average on-demand AoI, subject to per-slot transmission and energy constraints. We develop a low-complexity algorithm – termed relax-then-truncate – and prove that it is asymptotically optimal as the number of sensors goes to infinity. Numerical results assess the performance of the proposed method.\",\"PeriodicalId\":348168,\"journal\":{\"name\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT50566.2022.9834773\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT50566.2022.9834773","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

我们考虑一个资源受限的物联网网络,其中用户按需向启用缓存的边缘节点发出请求,以发送有关各种随机进程的状态更新,每个进程都由能量收集传感器监控。边缘节点通过命令相应的传感器发送新的状态更新或从缓存中检索最近收到的测量值来为用户的请求提供服务。我们的目标是在边缘节点上找到一个控制策略,以最小化请求时接收到的测量的平均信息年龄(AoI),即平均按需AoI,受每个插槽传输和能量约束。我们开发了一种低复杂度的算法-称为松弛-截断-并证明了它是渐近最优的,当传感器的数量趋于无穷。数值结果评估了所提方法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Asymptotically Optimal On-Demand AoI Minimization in Energy Harvesting IoT Networks
We consider a resource-constrained IoT network, where users make on-demand requests to a cache-enabled edge node to send status updates about various random processes, each monitored by an energy harvesting sensor. The edge node serves users’ requests by either commanding the corresponding sensor to send a fresh status update or retrieving the most recently received measurement from the cache. We aim to find a control policy at the edge node to minimize the average age of information (AoI) of the received measurements upon requests, i.e., average on-demand AoI, subject to per-slot transmission and energy constraints. We develop a low-complexity algorithm – termed relax-then-truncate – and prove that it is asymptotically optimal as the number of sensors goes to infinity. Numerical results assess the performance of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast Low Rank column-wise Compressive Sensing Ternary Message Passing Decoding of RS-SPC Product Codes Understanding Deep Neural Networks Using Sliced Mutual Information Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network Unlimited Sampling via Generalized Thresholding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1