期刊文献+

MIMO-NOMA系统下的URLLC与eMBB混合业务场景的共存调度研究 被引量:1

Coexistence scheduling of URLLC and eMBB mixed service scenarios in MIMO-NOMA system
原文传递
导出
摘要 增强移动带宽(enhancedmobilebroadband,eMBB)和超可靠低时延通信(ultra-reliableandlow-latency communications,URLLC)是5G移动通信网络中的两大主要服务。URLLC服务具有严格的时延和可靠性要求,eMBB服务具有巨大的吞吐量需求,2种业务差异化的服务质量(quality of service,QoS)需求,使两者在相同带宽资源上的共存成为一个极具挑战性的问题。基于下行链路的多输入多输出(multiple-input multiple-output,MIMO)非正交多址接入(non-orthogonal multiple access,NOMA)系统,在用户分簇的基础上,研究了URLLC和eMBB的共存策略,制定了一个URLLC和eMBB联合资源调度问题,在最大化eMBB业务频谱效率的同时满足URLLC业务的低时延需求。为求解该调度问题,提出了一个基于连续凸逼近(successive convex approximation,SCA)和凸函数差分规划(difference of convex functions,D.C.)的迭代算法。理论分析和数值结果证明了所提出的解决方案对于共存问题的适用性,在提升系统频谱效率的同时实现了多用户连接。 Enhanced mobile broadband(eMBB)and ultra-reliable and low-latency communications(URLLC)are the two main services in 5G mobile communication networks.URLLC has strict reliability and latency requirements,eMBB service has huge throughput requirements,and the two services have differentiated quality of service(QoS)requirements,which makes the coexistence of the two services in the same bandwidth resources a very challenging problem.A downlink-based multiple-input multiple-output(MIMO)with nonorthogonal multiple access(NOMA)system is established.On the basis of user clustering,the co-existence strategy of URLLC and eMBB is studied,and a joint resource scheduling problem of URLLC and eMBB is developed to maximize the spectral efficiency of eMBB services and meet the low latency requirements of URLLC efficiency.To solve this scheduling problem,an iterative algorithm based on the methods of successive convex approximation(SCA)and difference of convex functions(D.C.)programming is proposed.Theoretical analyses and numerical results demonstrate that the proposed solution is suitable for the coexistence problem,and can significantly improve the spectrum efficiency while realizing the multi-user connection.
作者 王佳佳 陈琪美 江昊 WANG Jiajia;CHEN Qimei;JIANG Hao(School of Electronic Information,Wuhan University,Wuhan 430072,China)
出处 《武汉大学学报(工学版)》 CAS CSCD 北大核心 2023年第9期1139-1145,共7页 Engineering Journal of Wuhan University
基金 国家自然科学基金项目(编号:61801333)。
关键词 增强移动带宽 超可靠低时延 资源分配 共存问题 enhanced mobile broadband ultra-reliable and low-latency communications resource allocation
  • 相关文献

参考文献1

二级参考文献11

  • 1M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the Association for Computing Machinery, 42:1115-1145, 1995.
  • 2S. Kim and M. Kojima. Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Computational Optimization and Applications, 26:143-154, 2003.
  • 3J.J. More and D.C. Sorensen. Computing a trust region step. SIAM Journal on Scientific and Statistical Computing, 4:553-572, 1983.
  • 4Y. Nesterov. Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9:141-160, 1998.
  • 5P.M. Pardalos and S.A. Vavasis. Quadratic programming with one negative eigenvalue is NP-hard. Journal o/Global Optimization, 1:15-22, 1991.
  • 6I. Polik and T. Terlaky. A survey of the S-lemma. SIAM Review, 49(3):371-418, 2007.
  • 7R.J. Stern and H. Wolkowicz. Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations. SIAM Journal on Optimization, 5:286-313, 1995.
  • 8Y. Ye. On affine scaling algorithms for nonconvex quadratic programming. Mathematical Programming, 56:285-300, 1992.
  • 9Y. Ye. Approximating global quadratic optimization with convex quadratic constraints. Journal of Global Optimization, 15:1-17, 1999.
  • 10Y. Ye. Approximating quadratic programming with bound and quadratic constraints. Mathematical Programming, 84:219-226, 1999.

共引文献1

同被引文献2

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部