Latency-Aware Radio Resource Optimization in Learning-Based Cloud-Aided Small Cell Wireless Networks

IF 5.3 2区 计算机科学 Q1 TELECOMMUNICATIONS IEEE Transactions on Green Communications and Networking Pub Date : 2023-09-19 DOI:10.1109/TGCN.2023.3317128
Syed Tamoor-ul-Hassan;Sumudu Samarakoon;Mehdi Bennis;Matti Latva-aho
{"title":"Latency-Aware Radio Resource Optimization in Learning-Based Cloud-Aided Small Cell Wireless Networks","authors":"Syed Tamoor-ul-Hassan;Sumudu Samarakoon;Mehdi Bennis;Matti Latva-aho","doi":"10.1109/TGCN.2023.3317128","DOIUrl":null,"url":null,"abstract":"Low latency communication is one of the fundamental requirements for 5G wireless networks and beyond. In this paper, a novel approach for joint caching, user scheduling and resource allocation is proposed for minimizing the queuing latency in serving users’ requests in cloud-aided wireless networks. Due to the slow temporal variations in user requests, a time-scale separation technique is used to decouple the joint caching problem from user scheduling and radio resource allocation problems. To serve the spatio-temporal user requests under storage limitations, a Reinforcement Learning (RL) approach is used to optimize the caching strategy at the small cell base stations by minimizing the content fetching cost. A spectral clustering algorithm is proposed to speed-up the convergence of the RL algorithm for a large content caching problem by clustering contents based on user requests. Meanwhile, a dynamic mechanism is proposed to locally group coupled base stations based on user requests to collaboratively optimize the caching strategies. To further improve the latency in fetching and serving user requests, a dynamic matching algorithm is proposed to schedule users and to allocate users to radio resources based on user requests and queue lengths under probabilistic latency constraints. Simulation results show the proposed approach significantly reduces the average delay from 21% to 90% compared to random caching strategy, random resource allocation and random scheduling baselines.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":null,"pages":null},"PeriodicalIF":5.3000,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Green Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10255239/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Low latency communication is one of the fundamental requirements for 5G wireless networks and beyond. In this paper, a novel approach for joint caching, user scheduling and resource allocation is proposed for minimizing the queuing latency in serving users’ requests in cloud-aided wireless networks. Due to the slow temporal variations in user requests, a time-scale separation technique is used to decouple the joint caching problem from user scheduling and radio resource allocation problems. To serve the spatio-temporal user requests under storage limitations, a Reinforcement Learning (RL) approach is used to optimize the caching strategy at the small cell base stations by minimizing the content fetching cost. A spectral clustering algorithm is proposed to speed-up the convergence of the RL algorithm for a large content caching problem by clustering contents based on user requests. Meanwhile, a dynamic mechanism is proposed to locally group coupled base stations based on user requests to collaboratively optimize the caching strategies. To further improve the latency in fetching and serving user requests, a dynamic matching algorithm is proposed to schedule users and to allocate users to radio resources based on user requests and queue lengths under probabilistic latency constraints. Simulation results show the proposed approach significantly reduces the average delay from 21% to 90% compared to random caching strategy, random resource allocation and random scheduling baselines.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于学习的云辅助小蜂窝无线网络中的延迟感知无线电资源优化
低延迟通信是 5G 无线网络及其他网络的基本要求之一。本文提出了一种联合缓存、用户调度和资源分配的新方法,以最小化云辅助无线网络中服务用户请求的排队延迟。由于用户请求的时间变化较慢,因此采用了时间尺度分离技术,将联合缓存问题与用户调度和无线资源分配问题解耦。为了在存储限制条件下满足用户的时空请求,采用了强化学习(RL)方法,通过最小化内容获取成本来优化小基站的缓存策略。针对大型内容缓存问题,提出了一种光谱聚类算法,通过根据用户请求对内容进行聚类来加快 RL 算法的收敛速度。同时,还提出了一种动态机制,根据用户请求对耦合基站进行本地分组,以协同优化缓存策略。为进一步改善获取和服务用户请求的延迟,提出了一种动态匹配算法,在概率延迟约束条件下,根据用户请求和队列长度调度用户并将用户分配到无线电资源。仿真结果表明,与随机缓存策略、随机资源分配和随机调度基线相比,所提出的方法将平均延迟从 21% 显著降低到 90%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Green Communications and Networking
IEEE Transactions on Green Communications and Networking Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
6.20%
发文量
181
期刊最新文献
Table of Contents Guest Editorial Special Issue on Green Open Radio Access Networks: Architecture, Challenges, Opportunities, and Use Cases IEEE Transactions on Green Communications and Networking IEEE Communications Society Information HSADR: A New Highly Secure Aggregation and Dropout-Resilient Federated Learning Scheme for Radio Access Networks With Edge Computing Systems
×
引用
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