LoWait: Learning Optimal Waiting Time Threshold to Minimize Age of Information Over Wireless Fading Channels

IF 6.3 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Open Journal of the Communications Society Pub Date : 2024-07-18 DOI:10.1109/OJCOMS.2024.3427117
Baoluo Chen;Yingcun Su;Liang Huang
{"title":"LoWait: Learning Optimal Waiting Time Threshold to Minimize Age of Information Over Wireless Fading Channels","authors":"Baoluo Chen;Yingcun Su;Liang Huang","doi":"10.1109/OJCOMS.2024.3427117","DOIUrl":null,"url":null,"abstract":"This paper focuses on using the age of information (AoI) as a key metric for measuring the freshness of status information in a wireless fading channel. Specifically, we examine a scenario where a sensor can sample, generate, and transmit update packets at will, with the stochasticity of transmission rate intricately linked to the channel state. Moreover, our goal is to formulate a waiting policy that minimizes the time average AoI by determining the waiting time following the completion of a transmission. We first introduce a straightforward yet efficient Learning Optimal Waiting Time Threshold (LoWait) algorithm for two-state Markov channels. LoWait operates without the need for prior knowledge of the probability distributions for transmission rates and the parameters of channel alternation. In the classical ON-OFF channels, we introduce the Robbins-Monroe iteration and prove that the optimality gap of LoWait diminishes at a rate of \n<inline-formula> <tex-math>${\\mathrm {O}}(1/\\sqrt{K})$ </tex-math></inline-formula>\n, where K is the number of updates. Numerical results affirm that LoWait can effectively reduce the average AoI compared to other benchmarks.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10601182","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of the Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10601182/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

This paper focuses on using the age of information (AoI) as a key metric for measuring the freshness of status information in a wireless fading channel. Specifically, we examine a scenario where a sensor can sample, generate, and transmit update packets at will, with the stochasticity of transmission rate intricately linked to the channel state. Moreover, our goal is to formulate a waiting policy that minimizes the time average AoI by determining the waiting time following the completion of a transmission. We first introduce a straightforward yet efficient Learning Optimal Waiting Time Threshold (LoWait) algorithm for two-state Markov channels. LoWait operates without the need for prior knowledge of the probability distributions for transmission rates and the parameters of channel alternation. In the classical ON-OFF channels, we introduce the Robbins-Monroe iteration and prove that the optimality gap of LoWait diminishes at a rate of ${\mathrm {O}}(1/\sqrt{K})$ , where K is the number of updates. Numerical results affirm that LoWait can effectively reduce the average AoI compared to other benchmarks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
LoWait:学习最佳等待时间阈值,最小化无线衰减信道上的信息年龄
本文的重点是将信息年龄(AoI)作为衡量无线衰落信道中状态信息新鲜度的关键指标。具体来说,我们研究了一种传感器可以随意采样、生成和传输更新数据包的场景,其传输速率的随机性与信道状态密切相关。此外,我们的目标是制定一种等待策略,通过确定传输完成后的等待时间来最小化时间平均 AoI。我们首先为双状态马尔可夫信道引入了一种简单高效的学习最佳等待时间阈值(LoWait)算法。LoWait 算法无需事先了解传输速率的概率分布和信道交替参数。在经典的ON-OFF信道中,我们引入了Robbins-Monroe迭代,并证明LoWait的最优性差距以${mathrm {O}}(1/\sqrt{K})$ 的速率减小,其中K是更新次数。数值结果证实,与其他基准相比,LoWait 可以有效降低平均 AoI。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
13.70
自引率
3.80%
发文量
94
审稿时长
10 weeks
期刊介绍: The IEEE Open Journal of the Communications Society (OJ-COMS) is an open access, all-electronic journal that publishes original high-quality manuscripts on advances in the state of the art of telecommunications systems and networks. The papers in IEEE OJ-COMS are included in Scopus. Submissions reporting new theoretical findings (including novel methods, concepts, and studies) and practical contributions (including experiments and development of prototypes) are welcome. Additionally, survey and tutorial articles are considered. The IEEE OJCOMS received its debut impact factor of 7.9 according to the Journal Citation Reports (JCR) 2023. The IEEE Open Journal of the Communications Society covers science, technology, applications and standards for information organization, collection and transfer using electronic, optical and wireless channels and networks. Some specific areas covered include: Systems and network architecture, control and management Protocols, software, and middleware Quality of service, reliability, and security Modulation, detection, coding, and signaling Switching and routing Mobile and portable communications Terminals and other end-user devices Networks for content distribution and distributed computing Communications-based distributed resources control.
期刊最新文献
Applied Federated Model Personalization in the Industrial Domain: A Comparative Study Federated Learning: Challenges, SoTA, Performance Improvements and Application Domains A Worst-Case Latency and Age Analysis of Coded Distributed Computing With Unreliable Workers and Periodic Tasks Sparse Bayesian Learning Using Complex t-Prior for Beam-Domain Massive MIMO Channel Estimation Privacy-Preserving Hierarchical Reinforcement Learning Framework for Task Offloading in Low-Altitude Vehicular Fog Computing
×
引用
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