最小上行系统信息峰值年龄的最优调度

Ridong Li, Junwei Lei, Qianying Zhou, Zhengchuan Chen, Min Wang, Zhong Tian
{"title":"最小上行系统信息峰值年龄的最优调度","authors":"Ridong Li, Junwei Lei, Qianying Zhou, Zhengchuan Chen, Min Wang, Zhong Tian","doi":"10.1109/VTC2022-Fall57202.2022.10012764","DOIUrl":null,"url":null,"abstract":"Age of information (AoI) is proposed to characterize the freshness of information. Since it describes the time elapsed since the information is generated, it can accurately characterize the freshness of the information. Most of the existing studies have focused on the average AoI of systems, but time-sensitive applications such as industrial control systems and sensing networks have strict requirements for information freshness. We consider the scenario of multi-terminal wireless uplink with random packet arrivals and study the system average peak AoI (PAoI) minimization and maximum PAoI minimization problem. First we derive a closed expression of the system average PAoI and sufficient and necessary conditions of the optimal policy, from which an optimal ratio based no butter policy (OR-NB) is developed. We further generalize it to a system design method to make the average PAoI of all terminals satisfy the corresponding hard constraints. In addition, a maximum expected peak AoI (EPAoI) increasing probability minimization policy is proposed to minimize the maximum PAoI, which is proved to be near-optimal.","PeriodicalId":326047,"journal":{"name":"2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Scheduling for Minimizing Peak Age of Information in Uplink Systems\",\"authors\":\"Ridong Li, Junwei Lei, Qianying Zhou, Zhengchuan Chen, Min Wang, Zhong Tian\",\"doi\":\"10.1109/VTC2022-Fall57202.2022.10012764\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Age of information (AoI) is proposed to characterize the freshness of information. Since it describes the time elapsed since the information is generated, it can accurately characterize the freshness of the information. Most of the existing studies have focused on the average AoI of systems, but time-sensitive applications such as industrial control systems and sensing networks have strict requirements for information freshness. We consider the scenario of multi-terminal wireless uplink with random packet arrivals and study the system average peak AoI (PAoI) minimization and maximum PAoI minimization problem. First we derive a closed expression of the system average PAoI and sufficient and necessary conditions of the optimal policy, from which an optimal ratio based no butter policy (OR-NB) is developed. We further generalize it to a system design method to make the average PAoI of all terminals satisfy the corresponding hard constraints. In addition, a maximum expected peak AoI (EPAoI) increasing probability minimization policy is proposed to minimize the maximum PAoI, which is proved to be near-optimal.\",\"PeriodicalId\":326047,\"journal\":{\"name\":\"2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VTC2022-Fall57202.2022.10012764\",\"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 96th Vehicular Technology Conference (VTC2022-Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTC2022-Fall57202.2022.10012764","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了信息时代(Age of information, AoI)来表征信息的新鲜度。由于它描述了自信息生成以来经过的时间,因此它可以准确地表征信息的新鲜度。现有的研究大多集中在系统的平均AoI上,但工业控制系统和传感网络等时间敏感应用对信息新鲜度有严格的要求。考虑随机分组到达的多终端无线上行场景,研究了系统平均峰值AoI (PAoI)最小化和最大PAoI最小化问题。首先导出了系统平均PAoI的封闭表达式和最优策略的充要条件,并由此导出了基于最优比率的无黄油策略(OR-NB)。我们进一步将其推广为一种系统设计方法,使所有终端的平均pai满足相应的硬约束。此外,提出了一种最大期望峰值AoI (EPAoI)增加概率最小化策略来最小化最大期望峰值AoI,并证明该策略是接近最优的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Scheduling for Minimizing Peak Age of Information in Uplink Systems
Age of information (AoI) is proposed to characterize the freshness of information. Since it describes the time elapsed since the information is generated, it can accurately characterize the freshness of the information. Most of the existing studies have focused on the average AoI of systems, but time-sensitive applications such as industrial control systems and sensing networks have strict requirements for information freshness. We consider the scenario of multi-terminal wireless uplink with random packet arrivals and study the system average peak AoI (PAoI) minimization and maximum PAoI minimization problem. First we derive a closed expression of the system average PAoI and sufficient and necessary conditions of the optimal policy, from which an optimal ratio based no butter policy (OR-NB) is developed. We further generalize it to a system design method to make the average PAoI of all terminals satisfy the corresponding hard constraints. In addition, a maximum expected peak AoI (EPAoI) increasing probability minimization policy is proposed to minimize the maximum PAoI, which is proved to be near-optimal.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信