Resource allocation in coordinated multipoint long term evolution – advanced networks

Abstract

Coordinated Multipoint (CoMP) in Long Term Evolution-Advanced (LTEAdvanced) improves cell-edge data rates and network spectral efficiency through base station coordination. In order to achieve high quality of service (QoS) in CoMP network, resource allocation approach is one of the main challenges. The resource allocation strategies of cells in CoMP network affect each other’s performance. Thus, the resource allocation approach should consider various diversities offered in multiuser wireless networks, particularly in frequency, spatial and time dimensions. The primary objective of this research is to develop resource allocation strategy for CoMP network that can provide high QoS. The resource allocation algorithm is developed through three phases, namely Low-Complexity Resource Allocation (LRA), Optimized Resource Allocation (ORA) and Cross-Layer Design of ORA (CLD-ORA). The LRA algorithm is a three-step resource allocation scheme that consists of user selection module, subcarrier allocation module and power allocation module which are performed sequentially in a multi-antenna CoMP network. The proposed ORA algorithm enhances throughput in LRA while ensuring fairness. ORA is formulated based on Lagrangian method and optimized using Particle Swarm Optimization (PSO). The design of CLD-ORA algorithm is an enhancement of the ORA algorithm with resource block (RB) scheduling scheme at medium access control (MAC) layer. Simulation study shows that the ORA algorithm improves the network sum-rate and fairness index up to 70% and 25%, respectively and reduces the average transmit power by 41% in relative to LRA algorithm. The CLD-ORA algorithm has further enhanced the LRA and ORA algorithms with network sum-rate improvement of 77% and 33%, respectively. The proposed resource allocation algorithm has been proven to provide a significant improved performance for CoMP LTE-Advanced network and can be extended to future 5G network.