323 research outputs found
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
Joint Multi-Cell Resource Allocation Using Pure Binary-Integer Programming for LTE Uplink
Due to high system capacity requirement, 3GPP Long Term Evolution (LTE) is
likely to adopt frequency reuse factor 1 at the cost of suffering severe
inter-cell interference (ICI). One of combating ICI strategies is network
cooperation of resource allocation (RA). For LTE uplink RA, requiring all the
subcarriers to be allocated adjacently complicates the RA problem greatly. This
paper investigates the joint multi-cell RA problem for LTE uplink. We model the
uplink RA and ICI mitigation problem using pure binary-integer programming
(BIP), with integrative consideration of all users' channel state information
(CSI). The advantage of the pure BIP model is that it can be solved by
branch-and-bound search (BBS) algorithm or other BIP solving algorithms, rather
than resorting to exhaustive search. The system-level simulation results show
that it yields 14.83% and 22.13% gains over single-cell optimal RA in average
spectrum efficiency and 5th percentile of user throughput, respectively.Comment: Accepted to IEEE Vehicular Technology Conference (VTC Spring), Seoul,
Korea, May, 201
Energy Efficient Reduced Complexity Multi-Service, Multi-Channel Scheduling Techniques
The need for energy efficient communications is essential in current and next-generation wireless communications systems. A large component of energy expenditure in mobile devices is in the mobile radio interface. Proper scheduling and resource allocation techniques that exploit instantaneous and long-term average knowledge of the channel, queue state and quality of service parameters can be used to improve the energy efficiency of communication.
This thesis focuses on exploiting queue and channel state information as well as quality of service parameters in order to design energy efficient scheduling techniques. The proposed designs are for multi-stream, multi-channel systems and in general have high computational complexity. The large contributions of this thesis are in both the design of optimal/near-optimal scheduling/resource allocation schemes for these systems as well as proposing complexity reduction methods in their design.
Methods are proposed for both a MIMO downlink system as well as an LTE uplink system. The effect of power efficiency on quality of service parameters is well studied as well as complexity/efficiency comparisons between optimal/near optimal allocation
Efficient Scheduling Algorithms for Wireless Resource Allocation and Virtualization in Wireless Networks
The continuing growth in demand for better mobile broadband experiences has motivated rapid development of radio-access technologies to support high data rates and improve quality of service (QoS) and quality of experience (QoE) for mobile users. However, the modern radio-access technologies pose new challenges to mobile network operators (MNO) and wireless device designers such as reducing the total cost of ownership while supporting high data throughput per user, and extending battery life-per-charge of the mobile devices. In this thesis, a variety of optimization techniques aimed at providing innovative solutions for such challenges are explored.
The thesis is divided into two parts. In the first part, the challenge of extending battery life-per-charge is addressed. Optimal and suboptimal power-efficient schedulers that minimize the total transmit power and meet the QoS requirements of the users are presented. The second outlines the benefits and challenges of deploying wireless resource virtualization (WRV) concept as a promising solution for satisfying the growing demand for mobile data and reducing capital and operational costs. First, a WRV framework is proposed for single cell zone that is able to centralize and share the spectrum resources between multiple MNOs. Consequently, several WRV frameworks are proposed, which virtualize the spectrum resource of the entire network for cloud radio access network (C-RAN)- one of the front runners for the next generation network architecture.
The main contributions of this thesis are in designing optimal and suboptimal solutions for the aforementioned challenges. In most cases, the optimal solutions suffer from high complexity, and therefore low-complexity suboptimal solutions are provided for practical systems. The optimal solutions are used as benchmarks for evaluating the suboptimal solutions. The results prove that the proposed solutions effectively contribute in addressing the challenges caused by the demand for high data rates and power transmission in mobile networks
Resource Allocation in Uplink Long Term Evolution
One of the most crucial goals of future cellular systems is to minimize transmission power while increasing system performance. This master thesis work presents two channel-queue-aware scheduling schemes to allocate channels among active users in uplink LTE. Transmission power, packet delays and data rates are three of the most important criteria critically affecting the resource allocation designs. Therefore, each of these two scheduling algorithms proposes a practical method that assigns resources in such a way so as to optimally maximize data rate and minimize transmission power and packet delays while ensuring the QoS requirements. After converting the resource allocation problem into an optimization problem, the objective function and associated constraints are derived. Due to the contiguity constraint, which is imposed by SC-FDMA in uplink LTE, binary integer programming is employed to solve the optimization problem. Also the heuristic algorithms that approximate optimal schemes are presented to decrease the algorithm complexity
Optimal Joint Subcarrier and Power Allocation in NOMA is Strongly NP-Hard
International audienceNon-orthogonal multiple access (NOMA) is a promising radio access technology for 5G. It allows several users to transmit on the same frequency and time resource by performing power-domain multiplexing. At the receiver side, successive interference cancellation (SIC) is applied to mitigate interference among the multiplexed signals. In this way, NOMA can outperform orthogonal multiple access schemes used in conventional cellular networks in terms of spectral efficiency and allows more simultaneous users. This paper investigates the computational complexity of joint subcarrier and power allocation problems in multi-carrier NOMA systems. We prove that these problems are strongly NP-hard for a large class of objective functions, namely the weighted generalized means of the individual data rates. This class covers the popular weighted sum-rate, proportional fairness, harmonic mean and max-min fairness utilities. Our results show that the optimal power and subcarrier allocation cannot be computed in polynomial time in the general case, unless P = NP. Nevertheless, we present some tractable special cases and we show that they can be solved efficiently
- …