马润琳,,
杨恒,
陈前斌
1.重庆邮电大学通信与信息工程学院 ??重庆 ??400065
2.重庆邮电大学移动通信技术重点实验室 ??重庆 ??400065
基金项目:国家自然科学基金(61571073)，重庆市教委科学技术研究项目(KJZD-M201800601)
详细信息
作者简介:唐伦：男，1973年生，教授，博士，研究方向为新一代无线通信网络、异构蜂窝网络、软件定义无线网络等
马润琳：女，1993年生，硕士生，研究方向为5G网络切片，网络功能虚拟化，无线资源分配等
杨恒：男，1993年生，硕士生，研究方向为切片及虚拟网络
陈前斌：男，1967年生，教授，博士生导师，研究方向为个人通信、多媒体信息处理与传输、下一代移动通信网络等
通讯作者:马润琳 357135128@qq.com
中图分类号:TN929.5计量
文章访问数:1703
HTML全文浏览量:837
PDF下载量:80
被引次数:0
出版历程
收稿日期:2018-08-23
修回日期:2019-03-20
网络出版日期:2019-05-30
刊出日期:2019-09-10
Joint User Association and Power Allocation Algorithm for Network Slicing Based on NOMA
Lun TANG,Runlin MA,,
Heng YANG,
Qianbin CHEN
1. School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
2. Key Laboratory of Mobile Communication Technology, Chongqing University of Post and Telecommunications, Chongqing 400065, China
Funds:The National Natural Science Foundation of China (61571073), The Science and Technology Research Program of Chongqing Municipal Education Commission (KJZD-M201800601)
摘要
摘要:为了满足网络切片多样化需求，实现无线虚拟资源的动态分配，该文提出在C-RAN架构中基于非正交多址接入的联合用户关联和功率资源分配算法。首先，该算法考虑在不完美信道条件下，以切片和用户最小速率需求及时延QoS要求、系统中断概率、前传容量为约束，建立在C-RAN场景中最大化长时平均网络切片总吞吐量的联合用户关联和功率分配模型。其次，将概率混合优化问题转换为非概率优化问题，并利用Lyapunov优化理论设计一种基于当前时隙的联合用户调度和功率分配的算法。最后采用贪婪算法求得用户关联问题次优解；基于用户关联的策略，将功率分配的问题利用连续凸逼近方法将其转换为凸优化问题并采用拉格朗日对偶分解方法获得功率分配策略。仿真结果表明，该算法能满足各网络切片和用户需求的同时有效提升系统时间平均切片总吞吐量。
关键词:网络切片/
资源分配/
不完美信道状态信息/
非正交多址接入
Abstract:To satisfy the diversity of requirements for different network slices and realize dynamic allocation of wireless virtual resource, an algorithm for network slice joint user association and power allocation is proposed in Non-Orthogonal Multiple Access(NOMA) C-RAN. Firstly, by considering imperfect Channel State Information(CSI), a joint user association and power allocation algorithm is designed to maximize the average total throughput in C-RAN with the constraints of slice and user minimum required rate, outage probability and fronthaul capacity limits. Secondly, a joint user association and power allocation algorithm is designed according to the current slot by transforming the probabilistic mixed optimalization problem into a non-probabilistic optimalization problem and using Lyapunov optimization. Finally, for user association problem, a greedy algorithm is proposed to find a feasible suboptimal solution; The power allocation problem is transformed into a convex optimization problem by using successive convex approximation; Then a dual decomposition approach is exploited to obtain a power allocation strategy. Simulation results demonstrate that the proposed algorithm can effectively improve the average total throughput of system while guaranteeing the network slice and user requirement.
Key words:Network slicing/
Resource allocation/
Imperfect Channel State Information (CSI)/
Non-Orthogonal Multiple Access (NOMA)
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=458c90d3-80ca-4906-9d24-974fd541a6a3
