Age-Gain-Dependent Random Access for Event-Driven Periodic Updating

IF 8.3 2区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Communications Pub Date : 2025-01-29 DOI:10.1109/TCOMM.2025.3535893
Yuqing Zhu;Yiwen Zhu;Aoyu Gong;Yan Lin;Yuan-Hsun Lo;Yijin Zhang
{"title":"Age-Gain-Dependent Random Access for Event-Driven Periodic Updating","authors":"Yuqing Zhu;Yiwen Zhu;Aoyu Gong;Yan Lin;Yuan-Hsun Lo;Yijin Zhang","doi":"10.1109/TCOMM.2025.3535893","DOIUrl":null,"url":null,"abstract":"This paper considers utilizing the knowledge of age gains to reduce the average age of information (AoI) in random access with event-driven periodic updating for the first time. Built on the form of slotted ALOHA, we require each device to determine its age gain threshold and transmission probability in an easily implementable decentralized manner, so that the contention can be limited to devices with age gains as high as possible. For the basic case that each device utilizes its knowledge of age gain of only itself, we provide an analytical modeling by a multi-layer discrete-time Markov chains (DTMCs), where an external DTMC manages the jumps between the beginnings of frames and an internal DTMC manages the evolution during an arbitrary frame, for obtaining optimal fixed access parameters offline. For the enhanced case that each device utilizes its knowledge of age gains of all the devices, we require each device to adjust its access parameters for maximizing the estimated network expected AoI reduction per slot, through maintaining the a posteriori joint probability distribution of local age and age gain of an arbitrary device in a Bayesian manner. Numerical results validate our study and demonstrate the advantage of the proposed schemes over other schemes.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"73 8","pages":"5774-5787"},"PeriodicalIF":8.3000,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Communications","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10857381/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

This paper considers utilizing the knowledge of age gains to reduce the average age of information (AoI) in random access with event-driven periodic updating for the first time. Built on the form of slotted ALOHA, we require each device to determine its age gain threshold and transmission probability in an easily implementable decentralized manner, so that the contention can be limited to devices with age gains as high as possible. For the basic case that each device utilizes its knowledge of age gain of only itself, we provide an analytical modeling by a multi-layer discrete-time Markov chains (DTMCs), where an external DTMC manages the jumps between the beginnings of frames and an internal DTMC manages the evolution during an arbitrary frame, for obtaining optimal fixed access parameters offline. For the enhanced case that each device utilizes its knowledge of age gains of all the devices, we require each device to adjust its access parameters for maximizing the estimated network expected AoI reduction per slot, through maintaining the a posteriori joint probability distribution of local age and age gain of an arbitrary device in a Bayesian manner. Numerical results validate our study and demonstrate the advantage of the proposed schemes over other schemes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
事件驱动周期性更新的年龄增益相关随机访问
本文首次考虑利用年龄增长的知识,通过事件驱动的周期性更新来降低随机存取中信息的平均年龄。基于开槽ALOHA的形式,我们要求每个设备以易于实现的分散方式确定其年龄增益阈值和传输概率,以便将争用限制在年龄增益尽可能高的设备上。对于每个设备仅利用其自身的年龄增益知识的基本情况,我们通过多层离散时间马尔可夫链(DTMC)提供了分析建模,其中外部DTMC管理帧开始之间的跳跃,内部DTMC管理任意帧期间的演变,以获得最佳的固定访问参数离线。对于每个设备利用其所有设备的年龄增益知识的增强情况,我们要求每个设备调整其接入参数,通过以贝叶斯方式保持任意设备的本地年龄和年龄增益的后验联合概率分布,以最大限度地估计每个时隙的网络期望AoI减少。数值结果验证了我们的研究,并证明了所提方案相对于其他方案的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Communications
IEEE Transactions on Communications 工程技术-电信学
CiteScore
16.10
自引率
8.40%
发文量
528
审稿时长
4.1 months
期刊介绍: The IEEE Transactions on Communications is dedicated to publishing high-quality manuscripts that showcase advancements in the state-of-the-art of telecommunications. Our scope encompasses all aspects of telecommunications, including telephone, telegraphy, facsimile, and television, facilitated by electromagnetic propagation methods such as radio, wire, aerial, underground, coaxial, and submarine cables, as well as waveguides, communication satellites, and lasers. We cover telecommunications in various settings, including marine, aeronautical, space, and fixed station services, addressing topics such as repeaters, radio relaying, signal storage, regeneration, error detection and correction, multiplexing, carrier techniques, communication switching systems, data communications, and communication theory. Join us in advancing the field of telecommunications through groundbreaking research and innovation.
期刊最新文献
Direct-to-Device Non-Terrestrial Communications Ensuring Interference-Free GSO Coexistence FDA-aided Covert Communication with Robust Optimization Hybrid RIS-Aided Digital Over-the-Air Computing for Edge AI Inference: Joint Feature Quantization and Active-Passive Beamforming Design Value-Based Selective Compression: Balancing Age of Information and Distortion Bringing Clarity to Composite Fading: A λ-κ-μ Shadowed Distribution for Complex Wireless Channels
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1