Joint Dynamic Radio Resource Allocation and Mobility Load Balancing in 3GPP LTE Multi-Cell Network

Load imbalance, together with inefficient utilization of system resource, constitute major factors responsible for poor overall performance in Long Term Evolution (LTE) network. In this paper, a novel scheme of joint dynamic resource allocation and load balancing is proposed to achieve a balanced performance improvement in 3rd Generation Partnership Project (3GPP) LTE Self-Organizing Networks (SON). The new method which aims at maximizing network resource efficiency subject to inter-cell interference and intra-cell resource constraints is implemented in two steps. In the first step, an efficient resource allocation, including user scheduling and power assignment, is conducted in a distributed manner to serve as many users in the whole network as possible. In the second step, based on the resource allocation scheme, the optimization objective namely network resource efficiency can be calculated and load balancing is implemented by switching the user that can maximize the objective function. Lagrange Multipliers method and heuristic algorithm are used to resolve the formulated optimization problem. Simulation results show that our algorithm achieves better performance in terms of user throughput, fairness, load balancing index and unsatisfied user number compared with the traditional approach which takes resource allocation and load balancing into account, respectively

Distributed Resource Allocation Assisted by Intercell Interference Mitigation in Downlink Multicell MC DS-CDMA Systems

This paper investigates the allocation of resources, including subcarriers and spreading codes, as well as intercell interference (ICI) mitigation for multicell downlink multicarrier direct-sequence code division multiple-access systems, which aim to maximize the system's spectral efficiency (SE). The analytical benchmark scheme for resource allocation and ICI mitigation is derived by solving or closely solving a series of mixed integer non-convex optimization problems. Based on the optimization objectives the same as the benchmark scheme, we propose a novel distributed resource allocation assisted by ICI mitigation scheme referred to as resource allocation assisted by ICI mitigation (RAIM), which requires very low implementation complexity and demands little backhaul resource. Our RAIM algorithm is a fully distributed algorithm, which consists of the subcarrier allocation (SA) algorithm named RAIM-SA, spreading code allocation (CA) algorithm called RAIM-CA and the ICI mitigation algorithm termed RAIM-IM. The advantages of the RAIM are that its CA only requires limited binary ICI information of intracell channels, and it is able to make mitigation decisions without any knowledge of ICI information. Our simulation results show that the proposed RAIM scheme, with very low complexity required, achieves significantly better SE performance than other existing schemes, and its performance is very close to that obtained by the benchmark scheme

Distributed Resource Optimization in Multicell OFDMA Networks

We consider the joint allocation of receiver, bit, and power to subcarriers in the downlink of multicell orthogonal frequency-division multiple-access (OFDMA) networks. Assuming that the cells share the entire bandwidth and that the rates are discrete, we formulate the joint allocation problem as a nonlinear mixed integer program (MIP), which however has exponential worst-case complexity. We capitalize on the capability of the receivers to measure the interference-plus-noise on every subcarrier and decompose the joint problem into a set of smaller-scale linear MIPs solved by individual base stations. Accordingly, we propose a distributed algorithm with linear complexity, in which the base stations participate in the problem solution in a round-robin manner. Simulation results demonstrate the effectiveness of the proposed algorithm in comparison with the iterative waterfilling algorithm and the successive optimal solution, by means of standard branch-and-cut solvers, of the individual MIPs