当前位置: X-MOL 学术IEEE Trans. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Robust Resource Allocation for Cooperative MISO-NOMA-Based Heterogeneous Networks
IEEE Transactions on Communications ( IF 8.3 ) Pub Date : 2021-03-02 , DOI: 10.1109/tcomm.2021.3063347
Atefeh Rezaei , Paeiz Azmi , Nader Mokari Yamchi , Mohammad Reza Javan , Halim Yanikomeroglu

In this paper, we consider a cooperative multiple-input single-output (MISO) heterogeneous communication network based on the power domain non-orthogonal multiple access (PD-NOMA). We aim to investigate a resource allocation problem regarding the uncertainty of the channel state information at the transmitter (CSIT) and the imperfect SIC case. Since there is an essential need for low-complexity algorithms with reasonably good performance for the extremely complex access architectures, we propose two novel methods based on matching game with externalities and successive convex approximation (SCA) to realize the hybrid scheme where the number of the cooperative nodes is variable. Moreover, we propose a new matching utility function to manage the interference caused by cooperative networks and PD-NOMA. We also devise two robust beamforming techniques to cope with the channel uncertainty based on the worst-case and stochastic-case scenarios. Simulation results evaluate the performance and the sensibility of the proposed methods and demonstrate that although the performance of the proposed distributed matching algorithm is slightly inferior to that of the SCA type, the complexity of the matching theory approach is substantially lower than that of the latter one.

中文翻译:

基于 MISO-NOMA 的协作异构网络的稳健资源分配

在本文中,我们考虑了基于功率域非正交多址 (PD-NOMA) 的协作多输入单输出 (MISO) 异构通信网络。我们的目标是研究关于发射机 (CSIT) 和不完美 SIC 情况下信道状态信息的不确定性的资源分配问题。由于极其复杂的访问架构需要具有合理良好性能的低复杂度算法,我们提出了两种基于外部性匹配博弈和逐次凸逼近 (SCA) 的新方法来实现混合方案,其中合作节点是可变的。此外,我们提出了一种新的匹配效用函数来管理由协作网络和 PD-NOMA 引起的干扰。我们还设计了两种稳健的波束成形技术,以应对基于最坏情况和随机情况的信道不确定性。仿真结果评估了所提出方法的性能和敏感性,表明尽管所提出的分布式匹配算法的性能略逊于 SCA 类型,但匹配理论方法的复杂度大大低于后者.
更新日期:2021-03-02
down
wechat
bug