Robust Resource Allocation for Cooperative MISO-NOMA-Based Heterogeneous Networks
Atefeh Rezaei, Paeiz Azmi, Nader Mokari, Mohammad Reza Javan, Halim Yanıkömeroğlu
Abstract
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.