Power and Channel Allocation for Non-orthogonal Multiple Access in 5G Systems: Tractability and Computation

Network capacity calls for significant increase for 5G cellular systems. A promising multi-user access scheme, non-orthogonal multiple access (NOMA) with successive interference cancellation (SIC), is currently under consideration. In NOMA, spectrum efficiency is improved by allowing more than one user to simultaneously access the same frequency-time resource and separating multi-user signals by SIC at the receiver. These render resource allocation and optimization in NOMA different from orthogonal multiple access in 4G. In this paper, we provide theoretical insights and algorithmic solutions to jointly optimize power and channel allocation in NOMA. For utility maximization, we mathematically formulate NOMA resource allocation problems. We characterize and analyze the problems' tractability under a range of constraints and utility functions. For tractable cases, we provide polynomial-time solutions for global optimality. For intractable cases, we prove the NP-hardness and propose an algorithmic framework combining Lagrangian duality and dynamic programming (LDDP) to deliver near-optimal solutions. To gauge the performance of the obtained solutions, we also provide optimality bounds on the global optimum. Numerical results demonstrate that the proposed algorithmic solution can significantly improve the system performance in both throughput and fairness over orthogonal multiple access as well as over a previous NOMA resource allocation scheme.Comment: IEEE Transactions on Wireless Communications, revisio

Energy Harvesting for Secure OFDMA Systems

Energy harvesting and physical-layer security in wireless networks are of great significance. In this paper, we study the simultaneous wireless information and power transfer (SWIPT) in downlink orthogonal frequency-division multiple access (OFDMA) systems, where each user applies power splitting to coordinate the energy harvesting and information decoding processes while secrecy information requirement is guaranteed. The problem is formulated to maximize the aggregate harvested power at the users while satisfying secrecy rate requirements of all users by subcarrier allocation and the optimal power splitting ratio selection. Due to the NP-hardness of the problem, we propose an efficient iterative algorithm. The numerical results show that the proposed method outperforms conventional methods.Comment: Accepted by WCSP 201

Slow Adaptive OFDMA Systems Through Chance Constrained Programming

Adaptive OFDMA has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wireless systems. The research over the last decade on adaptive OFDMA systems has focused on adapting the allocation of radio resources, such as subcarriers and power, to the instantaneous channel conditions of all users. However, such "fast" adaptation requires high computational complexity and excessive signaling overhead. This hinders the deployment of adaptive OFDMA systems worldwide. This paper proposes a slow adaptive OFDMA scheme, in which the subcarrier allocation is updated on a much slower timescale than that of the fluctuation of instantaneous channel conditions. Meanwhile, the data rate requirements of individual users are accommodated on the fast timescale with high probability, thereby meeting the requirements except occasional outage. Such an objective has a natural chance constrained programming formulation, which is known to be intractable. To circumvent this difficulty, we formulate safe tractable constraints for the problem based on recent advances in chance constrained programming. We then develop a polynomial-time algorithm for computing an optimal solution to the reformulated problem. Our results show that the proposed slow adaptation scheme drastically reduces both computational cost and control signaling overhead when compared with the conventional fast adaptive OFDMA. Our work can be viewed as an initial attempt to apply the chance constrained programming methodology to wireless system designs. Given that most wireless systems can tolerate an occasional dip in the quality of service, we hope that the proposed methodology will find further applications in wireless communications

Radio resource allocation for multicarrier-low density spreading multiple access

Multicarrier-low density spreading multiple access (MC-LDSMA) is a promising multiple access technique that enables near optimum multiuser detection. In MC-LDSMA, each user’s symbol spread on a small set of subcarriers, and each subcarrier is shared by multiple users. The unique structure of MC-LDSMA makes the radio resource allocation more challenging comparing to some well-known multiple access techniques. In this paper, we study the radio resource allocation for single-cell MC-LDSMA system. Firstly, we consider the single-user case, and derive the optimal power allocation and subcarriers partitioning schemes. Then, by capitalizing on the optimal power allocation of the Gaussian multiple access channel, we provide an optimal solution for MC-LDSMA that maximizes the users’ weighted sum-rate under relaxed constraints. Due to the prohibitive complexity of the optimal solution, suboptimal algorithms are proposed based on the guidelines inferred by the optimal solution. The performance of the proposed algorithms and the effect of subcarrier loading and spreading are evaluated through Monte Carlo simulations. Numerical results show that the proposed algorithms significantly outperform conventional static resource allocation, and MC-LDSMA can improve the system performance in terms of spectral efficiency and fairness in comparison with OFDMA

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

Cooperative Interference Control for Spectrum Sharing in OFDMA Cellular Systems

This paper studies cooperative schemes for the inter-cell interference control in orthogonal-frequency-divisionmultiple- access (OFDMA) cellular systems. The downlink transmission in a simplified two-cell system is examined, where both cells simultaneously access the same frequency band using OFDMA. The joint power and subcarrier allocation over the two cells is investigated for maximizing their sum throughput with both centralized and decentralized implementations. Particularly, the decentralized allocation is achieved via a new cooperative interference control approach, whereby the two cells independently implement resource allocation to maximize individual throughput in an iterative manner, subject to a set of mutual interference power constraints. Simulation results show that the proposed decentralized resource allocation schemes achieve the system throughput close to that by the centralized scheme, and provide substantial throughput gains over existing schemes.Comment: To appear in ICC201