OFDM状态更新系统中信息最小化时代的资源分配

Shuyang Fang, Zhengchuan Chen, Zhong Tian, Yunjian Jia, Min Wang
{"title":"OFDM状态更新系统中信息最小化时代的资源分配","authors":"Shuyang Fang, Zhengchuan Chen, Zhong Tian, Yunjian Jia, Min Wang","doi":"10.1109/GLOBECOM46510.2021.9685987","DOIUrl":null,"url":null,"abstract":"For timeliness-sensitive applications in Internet of things (IoT) systems, it is critical to efficiently allocate transmission resources such that the freshness of information updates can be improved. This paper focuses on timely status updating in an orthogonal frequency division multiplexing-based IoT systems, in which all devices update status to one data center by sharing available bandwidth. To improve the timeliness of updates, a resource allocation optimization problem is formulated, based on finite blocklength (FBL) transmission and the age of information (AoI) metric. Two suboptimal policies, namely, fixed time slot policy and fixed blocklength policy, along with an iterative optimization algorithm, and an approximate optimal policy are presented for addressing the optimal resource allocation. By comparing the performance of different policies, it is shown that the iterative algorithm and the approximate optimal policy outperforms the other two suboptimal policies, and closely approaches the global optimal resource allocation.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Resource Allocation for Age of Information Minimization in An OFDM Status Update System\",\"authors\":\"Shuyang Fang, Zhengchuan Chen, Zhong Tian, Yunjian Jia, Min Wang\",\"doi\":\"10.1109/GLOBECOM46510.2021.9685987\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For timeliness-sensitive applications in Internet of things (IoT) systems, it is critical to efficiently allocate transmission resources such that the freshness of information updates can be improved. This paper focuses on timely status updating in an orthogonal frequency division multiplexing-based IoT systems, in which all devices update status to one data center by sharing available bandwidth. To improve the timeliness of updates, a resource allocation optimization problem is formulated, based on finite blocklength (FBL) transmission and the age of information (AoI) metric. Two suboptimal policies, namely, fixed time slot policy and fixed blocklength policy, along with an iterative optimization algorithm, and an approximate optimal policy are presented for addressing the optimal resource allocation. By comparing the performance of different policies, it is shown that the iterative algorithm and the approximate optimal policy outperforms the other two suboptimal policies, and closely approaches the global optimal resource allocation.\",\"PeriodicalId\":200641,\"journal\":{\"name\":\"2021 IEEE Global Communications Conference (GLOBECOM)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Global Communications Conference (GLOBECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOBECOM46510.2021.9685987\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM46510.2021.9685987","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

对于物联网系统中对时效性敏感的应用,有效分配传输资源以提高信息更新的新鲜度至关重要。本文主要研究基于正交频分复用的物联网系统中状态的及时更新,其中所有设备通过共享可用带宽将状态更新到一个数据中心。为了提高更新的时效性,提出了一个基于有限块长度(FBL)传输和信息年龄(AoI)度量的资源分配优化问题。提出了两个次优策略,即固定时隙策略和固定块长策略,以及一个迭代优化算法和一个近似最优策略来解决资源的最优分配问题。通过比较不同策略的性能,表明迭代算法和近似最优策略优于其他两种次优策略,并接近全局最优资源分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Resource Allocation for Age of Information Minimization in An OFDM Status Update System
For timeliness-sensitive applications in Internet of things (IoT) systems, it is critical to efficiently allocate transmission resources such that the freshness of information updates can be improved. This paper focuses on timely status updating in an orthogonal frequency division multiplexing-based IoT systems, in which all devices update status to one data center by sharing available bandwidth. To improve the timeliness of updates, a resource allocation optimization problem is formulated, based on finite blocklength (FBL) transmission and the age of information (AoI) metric. Two suboptimal policies, namely, fixed time slot policy and fixed blocklength policy, along with an iterative optimization algorithm, and an approximate optimal policy are presented for addressing the optimal resource allocation. By comparing the performance of different policies, it is shown that the iterative algorithm and the approximate optimal policy outperforms the other two suboptimal policies, and closely approaches the global optimal resource allocation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Blockchain-based Energy Trading Scheme for Dynamic Charging of Electric Vehicles Algebraic Design of a Class of Rate 1/3 Quasi-Cyclic LDPC Codes A Fast and Scalable Resource Allocation Scheme for End-to-End Network Slices Modelling of Multi-Tier Handover in LiFi Networks Enabling Efficient Scheduling Policy in Intelligent Reflecting Surface Aided Federated Learning
×
引用
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