Resource allocation for non-orthogonal multiple access in heterogeneous networks
Resource allocation for non-orthogonal multiple access in heterogeneous networks
复制标题
DOI：
10.1109/icc.2017.7997327
复制
发表时间：
2017-05
期刊：
影响因子：
--
通讯作者：
Jingjing Zhao;Yuanwei Liu;K. K. Chai-K.;A. Nallanathan;Yue Chen;Zhu Han
中科院分区：
文献类型：
--
作者：
Jingjing Zhao;Yuanwei Liu;K. K. Chai-K.;A. Nallanathan;Yue Chen;Zhu Han
本文研究了基于NOMA增强异构网络（Het-Nets）的新型资源分配设计，该网络使小蜂窝基站（SBSs）能够通过NOMA协议与多个小蜂窝用户（scu）通信。以最大化scu的和率为目标的资源分配问题被表述为一个多对一的匹配博弈。由于同信道干扰的存在，该博弈属于一类具有同伴效应的匹配博弈。为了解决这一问题，我们提出了一种新的分布式算法，其中SBSs和资源块（RBs）可以相互作用以决定其期望的分配。与集中式算法相比，该算法收敛于双边交换稳定匹配，且复杂度大大降低。仿真结果表明：1)算法在有限的迭代次数内接近全局最优解约92.5%；2)与传统的基于oma的HetNets方案相比，所开发的noma增强HetNets方案实现了更高的scu和速率。
In this paper, novel resource allocation design is investigated for NOMA-enhanced heterogeneous networks (Het-Nets), where small cell base stations (SBSs) are enabled to communicate with multiple small cell users (SCUs) via the NOMA protocol. The resource allocation problem with the aim of maximizing the sum rate of SCUs is formulated as a many-to-one matching game. Due to the existence of co-channel interference, this game is shown to belong to a class of matching games with peer effects. To solve this game, we propose a novel distributed algorithm where the SBSs and resource blocks (RBs) can interact to decide their desired allocation. The proposed algorithm is proved to converge to a two-sided exchange-stable matching with much lower complexity compared to the centralized method. Simulation results unveil that: 1) The proposed algorithm closely approaches the global optimal solution by around 92.5% within a limited number of iterations; and 2) The developed NOMA-enhanced HetNets scheme achieves a higher sum rate of SCUs compared to the traditional OMA-based HetNets scheme.