论文标题
低复杂性联合用户和下行链路NOMA的功率调度在褪色的频道上
Low-complexity joint user and power scheduling in downlink NOMA over fading channels
论文作者
论文摘要
非正交多访问（NOMA）被认为是下一代蜂窝网络最有前途的无线电访问技术之一。在本文中，我们研究了下行链路NOMA的联合用户和功率调度。具体来说，我们专注于随机优化问题，以最大化加权平均总和，同时确保给定最低用户的平均数据率。为了解决这个问题，我们首先基于双重性和随机优化理论开发了机会性用户和功率调度算法（OUP）。通过OUP，将随机问题转化为一个确定性问题，以确定每个插槽的瞬时加权总和速率最大化。因此，对于瞬时加权总和速率最大化问题，我们还开发具有非常低的计算复杂性（称为用户选择和功率分配算法（USPA））的启发式算法。通过仿真结果，我们证明USPA提供了近乎最佳的性能，计算复杂性非常低，并且在最低平均数据速率的情况下，OUP可以很好地保证。
Non-orthogonal multiple access (NOMA) has been considered one of the most promising radio access techniques for next-generation cellular networks. In this paper, we study the joint user and power scheduling for downlink NOMA over fading channels. Specifically, we focus on a stochastic optimization problem to maximize the weighted average sum rate while ensuring given minimum average data rates of users. To address this problem, we first develop an opportunistic user and power scheduling algorithm (OUPS) based on the duality and stochastic optimization theory. By OUPS, the stochastic problem is transformed into a series of deterministic ones for the instantaneous weighted sum rate maximization for each slot. Thus, we additionally develop a heuristic algorithm with very low computational complexity, called user selection and power allocation algorithm (USPA), for the instantaneous weighted sum rate maximization problem. Via simulation results, we demonstrate that USPA provides near-optimal performance with very low computational complexity, and OUPS well guarantees given minimum average data rates.
