Joint AP-user association and caching strategy for delivery delay minimization in cell-free massive MIMO systems

IF 1.5 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC IET Communications Pub Date : 2023-12-27 DOI:10.1049/cmu2.12717
Rui Wang, Min Shen, Yun He, Xiangyan Liu
{"title":"Joint AP-user association and caching strategy for delivery delay minimization in cell-free massive MIMO systems","authors":"Rui Wang,&nbsp;Min Shen,&nbsp;Yun He,&nbsp;Xiangyan Liu","doi":"10.1049/cmu2.12717","DOIUrl":null,"url":null,"abstract":"<p>Edge caching at access points (APs) is a promising approach to alleviate the fronthaul burden and reduce user-perceived delay. However, the edge caching placement is still challenging considering the coupling between caching and AP-user association, limited fronthaul capacity, and multi-AP deployment in the cell-free (CF) massive MIMO systems. To this end, the authors establish a framework for the joint problem of AP-user association and caching to minimize the content delivery delay which considers both cooperation delivery delay and radio access delay. It is an integer nonlinear programming problem and NP-hard. The optimization problem is first decomposed into an AP-user association sub-problem and a caching placement sub-problem to address this problem. A two-stage matching algorithm is further proposed to achieve AP-user association and a modified genetic algorithm to determine caching placement. A computationally efficient iterative algorithm is developed to solve the joint optimization problem. Finally, the global convergence and computational complexity of the proposed strategy are analyzed theoretically. Simulation results reveal that the proposed strategy can achieve better delivery delay performance than benchmark schemes.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2023-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12717","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Communications","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.12717","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Edge caching at access points (APs) is a promising approach to alleviate the fronthaul burden and reduce user-perceived delay. However, the edge caching placement is still challenging considering the coupling between caching and AP-user association, limited fronthaul capacity, and multi-AP deployment in the cell-free (CF) massive MIMO systems. To this end, the authors establish a framework for the joint problem of AP-user association and caching to minimize the content delivery delay which considers both cooperation delivery delay and radio access delay. It is an integer nonlinear programming problem and NP-hard. The optimization problem is first decomposed into an AP-user association sub-problem and a caching placement sub-problem to address this problem. A two-stage matching algorithm is further proposed to achieve AP-user association and a modified genetic algorithm to determine caching placement. A computationally efficient iterative algorithm is developed to solve the joint optimization problem. Finally, the global convergence and computational complexity of the proposed strategy are analyzed theoretically. Simulation results reveal that the proposed strategy can achieve better delivery delay performance than benchmark schemes.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无小区大规模多输入多输出系统中实现传输延迟最小化的 AP-用户联合关联和缓存策略
接入点(AP)的边缘缓存是一种很有前途的方法,可减轻前传负担并降低用户感知延迟。然而,考虑到缓存与接入点-用户关联之间的耦合、有限的前端链路容量以及无小区(CF)大规模多输入多输出(MIMO)系统中的多接入点部署,边缘缓存的布置仍具有挑战性。为此,作者为 AP 用户关联和高速缓存的联合问题建立了一个框架,以最小化内容交付延迟,该框架同时考虑了合作交付延迟和无线接入延迟。这是一个整数非线性编程问题,具有 NP 难度。为解决这一问题,首先将优化问题分解为 AP 用户关联子问题和缓存放置子问题。进一步提出了一种两阶段匹配算法来实现 AP 用户关联,以及一种改进的遗传算法来确定缓存位置。还开发了一种计算高效的迭代算法来解决联合优化问题。最后,从理论上分析了所提策略的全局收敛性和计算复杂性。仿真结果表明,与基准方案相比,所提出的策略能实现更好的传输延迟性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IET Communications
IET Communications 工程技术-工程:电子与电气
CiteScore
4.30
自引率
6.20%
发文量
220
审稿时长
5.9 months
期刊介绍: IET Communications covers the fundamental and generic research for a better understanding of communication technologies to harness the signals for better performing communication systems using various wired and/or wireless media. This Journal is particularly interested in research papers reporting novel solutions to the dominating problems of noise, interference, timing and errors for reduction systems deficiencies such as wasting scarce resources such as spectra, energy and bandwidth. Topics include, but are not limited to: Coding and Communication Theory; Modulation and Signal Design; Wired, Wireless and Optical Communication; Communication System Special Issues. Current Call for Papers: Cognitive and AI-enabled Wireless and Mobile - https://digital-library.theiet.org/files/IET_COM_CFP_CAWM.pdf UAV-Enabled Mobile Edge Computing - https://digital-library.theiet.org/files/IET_COM_CFP_UAV.pdf
期刊最新文献
A deep learning-based approach for pseudo-satellite positioning Analysis of interference effect in VL-NOMA network considering signal power parameters performance A high-precision timing and frequency synchronization algorithm for multi-h CPM signals Dual-user joint sensing and communications with time-divisioned bi-static radar A heuristic approach to energy efficient user association in ultra-dense HetNets using intermittent scheduling strategies
×
引用
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