Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks

This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using OFDMA for both uplink and downlink. The goal is to improve the overall system performance by exploring the full potential of the network in various dimensions including user, subcarrier, relay, and bidirectional traffic. In this work, we first introduce a novel three-time-slot time-division duplexing (TDD) transmission protocol. This protocol unifies direct transmission, one-way relaying and network-coded two-way relaying between the BS and each MS. Using the proposed three-time-slot TDD protocol, we then propose an optimization framework for resource allocation to achieve the following gains: cooperative diversity (via relay selection), network coding gain (via bidirectional transmission mode selection), and multiuser diversity (via subcarrier assignment). We formulate the problem as a combinatorial optimization problem, which is NP-complete. To make it more tractable, we adopt a graph-based approach. We first establish the equivalence between the original problem and a maximum weighted clique problem in graph theory. A metaheuristic algorithm based on any colony optimization (ACO) is then employed to find the solution in polynomial time. Simulation results demonstrate that the proposed protocol together with the ACO algorithm significantly enhances the system total throughput.Comment: 27 pages, 8 figures, 2 table

A Tutorial on Nonorthogonal Multiple Access for 5G and Beyond

Today's wireless networks allocate radio resources to users based on the orthogonal multiple access (OMA) principle. However, as the number of users increases, OMA based approaches may not meet the stringent emerging requirements including very high spectral efficiency, very low latency, and massive device connectivity. Nonorthogonal multiple access (NOMA) principle emerges as a solution to improve the spectral efficiency while allowing some degree of multiple access interference at receivers. In this tutorial style paper, we target providing a unified model for NOMA, including uplink and downlink transmissions, along with the extensions tomultiple inputmultiple output and cooperative communication scenarios. Through numerical examples, we compare the performances of OMA and NOMA networks. Implementation aspects and open issues are also detailed.Comment: 25 pages, 10 figure

An Opportunistic-Non Orthogonal Multiple Access based Cooperative Relaying system over Rician Fading Channels

Non-orthogonal Multiple Access (NOMA) has become a salient technology for improving the spectral efficiency of the next generation 5G wireless communication networks. In this paper, the achievable average rate of an Opportunistic Non-Orthogonal Multiple Access (O-NOMA) based Cooperative Relaying System (CRS) is studied under Rician fading channels with Channel State Information (CSI) available at the source terminal. Based on CSI, for opportunistic transmission, the source immediately chooses either the direct transmission or the cooperative NOMA transmission using the relay, which can provide better achievable average rate performance than the existing Conventional-NOMA (C-NOMA) based CRS with no CSI at the source node. Furthermore, a mathematical expression is also derived for the achievable average rate and the results are compared with C-NOMA based CRS with no CSI at the transmitter end, over a range of increasing power allocation coefficients, transmit Signal-to-Noise Ratios (SNRs) and average channel powers. Numerical results show that the CRS using O-NOMA with CSI achieves better spectral efficiency in terms of the achievable average rate than the Conventional-NOMA based CRS without CSI. To check the consistency of the derived analytical results, Monte Carlo simulations are performed which verify that the results are consistent and matched well with the simulation results.Comment: arXiv admin note: substantial text overlap with arXiv:1709.0822