Beyond Single-User Scheduling: Exploiting Massive MIMO for Concurrent Data Delivery With Minimum Age of Information

IF 5.3 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Muhammad Fahad Ijaz;Umar Rashid;Omer Waqar
{"title":"Beyond Single-User Scheduling: Exploiting Massive MIMO for Concurrent Data Delivery With Minimum Age of Information","authors":"Muhammad Fahad Ijaz;Umar Rashid;Omer Waqar","doi":"10.1109/OJVT.2024.3523247","DOIUrl":null,"url":null,"abstract":"With the emergence of real-time applications, modern wireless networks have witnessed the use of Age of Information (AoI) as a critical metric for evaluating the timeliness of data delivery. This paper considers multi-user scheduling, extending beyond traditional single-user scheduling, to exploit the potential of Massive Multiple-Input Multiple-Output (mMIMO) systems for concurrent data delivery over imperfectly known channel state information (CSI). We propose a novel transmission scheduling framework that leverages the spatial multiplexing capabilities of mMIMO to minimize the AoI across multiple users. This results in a joint optimization of multi-user scheduling and power allocation problem for optimum data freshness in a wireless broadcast network. We handle the non-convexity of the resulting problem by utilizing successive convex approximation to specifically reformulate the binary/integer and non-convex constraints of the problem. Extensive simulations demonstrate superior performance of the proposed framework and its solution in terms of AoI compared to existing benchmarks.","PeriodicalId":34270,"journal":{"name":"IEEE Open Journal of Vehicular Technology","volume":"6 ","pages":"301-314"},"PeriodicalIF":5.3000,"publicationDate":"2024-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10818777","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of Vehicular Technology","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10818777/","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

With the emergence of real-time applications, modern wireless networks have witnessed the use of Age of Information (AoI) as a critical metric for evaluating the timeliness of data delivery. This paper considers multi-user scheduling, extending beyond traditional single-user scheduling, to exploit the potential of Massive Multiple-Input Multiple-Output (mMIMO) systems for concurrent data delivery over imperfectly known channel state information (CSI). We propose a novel transmission scheduling framework that leverages the spatial multiplexing capabilities of mMIMO to minimize the AoI across multiple users. This results in a joint optimization of multi-user scheduling and power allocation problem for optimum data freshness in a wireless broadcast network. We handle the non-convexity of the resulting problem by utilizing successive convex approximation to specifically reformulate the binary/integer and non-convex constraints of the problem. Extensive simulations demonstrate superior performance of the proposed framework and its solution in terms of AoI compared to existing benchmarks.
超越单用户调度:利用最小信息年龄的大规模MIMO并发数据传输
随着实时应用的出现,现代无线网络见证了信息时代(AoI)作为评估数据传输及时性的关键指标的使用。本文考虑了多用户调度,扩展了传统的单用户调度,以利用大规模多输入多输出(mMIMO)系统在不完全已知信道状态信息(CSI)上并发数据传输的潜力。我们提出了一种新的传输调度框架,利用mimo的空间复用能力来最小化跨多个用户的AoI。这导致了无线广播网络中多用户调度和功率分配问题的联合优化,以获得最佳的数据新鲜度。我们通过利用连续凸近似具体地重新表述问题的二进制/整数和非凸约束来处理结果问题的非凸性。大量的仿真表明,与现有基准测试相比,所提出的框架及其解决方案在AoI方面具有优越的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
9.60
自引率
0.00%
发文量
25
审稿时长
10 weeks
×
引用
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学术官方微信