访问量:   最后更新时间:--

姜淼

教师拼音名称:Jiang Miao
所在单位:信息工程学院
联系方式:jmiao@gdut.edu.cn
职称:副教授
所属院系:信息工程学院
其他联系方式

邮箱:

论文成果
Cache Content Placement Optimization in Non-Orthogonal Multiple Access Networks
发布时间:2022-09-01    点击次数:

影响因子:6.166

DOI码:10.1109/TCOMM.2020.2985958

发表刊物:IEEE Transactions on Communications

摘要:Incorporating wireless caching in non-orthogonal multiple access (NOMA) networks is a promising technique to reduce the delivery latency and improve the quality of service. In this paper, we study a cache content placement optimization problem in a cellular NOMA downlink wireless caching network. Our goal is to minimize the average transmit power under the cache capacity constraints. The optimization problem is a non-linear integer programming, which is non-deterministic polynomial-time hard. To efficiently solve the problem, an alternating upper plane method based on quadratic knapsack problem (QKP) is proposed. To deal with the general situation that the sizes of files and cache capacities are not integers, an alternating method based on semidefinite relaxation is also proposed. Finally, a constrained concave-convex procedure-based iterative method is proposed to further reduce the computational complexity. Simulation results show that our proposed methods are superior to the schemes which cache the most popular files until the cache is full.

合写作者:姜淼,秦家银

第一作者:李亦卿

论文类型:期刊论文

通讯作者:张旗

学科门类:工学

一级学科:信息与通信工程

文献类型:J

卷号:68

期号:7

页面范围:4580–4591

ISSN号:1558-0857

是否译文:

发表时间:2020-07-01

收录刊物:SCI

发布期刊链接:https://ieeexplore.ieee.org/document/9057601