I am analyzing the complexity of resource allocation problems in NOMA systems. The network model is shortly summarized as: a base station (BS) and multiple users (UES), singles for all UEs are superimposed at the BS, and the objective is to allocate at the BS so that optimize the resources. In addition, I am using the network sum-rate maximization is a baseline, which is NP-Hard according to my own finding. However, I am not sure about this (NP-Hardness of the sum-rate maximization problem).

Does anyone have any suggestions for me?

Many thanks in advance.

Similar questions and discussions