Search

Non-orthogonal multiple access (NOMA) is a promising scheme for the fifth generation (5G) of mobile communication systems. In this scheme, transmission to multiple users is performed on the same subchannel using superposition coding and successive interference cancellation. In this paper, we focus on a multi-cell network with two users’ data traffic models, namely elastic and streaming. We exploit the NOMA scheme in order to maximize the download elastic traffic rate at cells, without degrading the download streaming traffic rates. Since elastic traffic rates at different cells are interactive, we maximize the total elastic traffic rates assuming either perfect or partial channel state information available at each base station subject to a target rate for streaming users. Because of the interference due to NOMA as well as the interference among different cells, subchannel assignment and power allocation affect the system performance significantly. For this reason, we propose an iterative algorithm to jointly solve the subchannel assignment and the power allocation problem via the Hungarian algorithm and successive convex approximation, respectively. Finally, our simulation results show the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper considers a heavy loaded full-duplex (FD) small cell consisting of one FD base station and multiple half-duplex users where the number of subchannels is less than the number of uplink and downlink users. With the objective of maximizing the total sum-rate, a joint power allocation, and user pairing problem is formulated. To solve this problem, a novel decomposition method is proposed, which decouples the power allocation and user pairing problem into two subproblems. It is proven that the optimal solution of subproblems is the optimal solution of the original problem. Then, optimal algorithms are developed for the two subproblems. Numerical results show that the proposed algorithm achieves better performance compared with the baselines of the greedy algorithm and random pairing algorithm. [ABSTRACT FROM AUTHOR]