Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/15403
Title: Semi-Static Cell Differentiation and Integration with Dynamic BBU-RRH Mapping in Cloud Radio Access Network
Authors: Khan, M
Fakhri, Z
Al-Raweshidy, H
Keywords: - Base Band Unit (BBU);Cloud Radio Access;Particle Swarm Optimisation (PSO),;RemoteRadio Head (RRH),;Self-Organising Network (SON).
Issue Date: 2017
Publisher: IEEE
Citation: IEEE Transaction on Network and Service Nangement, vol 104(20): (TNSM-2017-01422.R2), pp. 45 - 65, (2018)
Abstract: Abstract—In this paper, a Self-Organising Cloud Radio Access Network is proposed, which dynamically adapt to varying network capacity demands. A load prediction model is considered for provisioning and allocation of Base Band Units (BBUs) and Remote Radio Heads (RRHs). The density of active BBUs and RRHs is scaled based on the concept of cell differentiation and integration (CDI) aiming efficient resource utilisation without sacrificing the overall QoS. A CDI algorithm is proposed in which a semi-static CDI and dynamic BBU-RRH mapping for load balancing are performed jointly. Network load balance is formulated as a linear integer-based optimisation problem with constraints.The semi-static part of CDI algorithm selects proper BBUs and RRHs for activation/deactivation after a fixed CDI cycle, and the dynamic part performs proper BBU to RRH mapping for network load balancing aiming maximum Quality of Service (QoS) with minimum possible handovers. A Discrete Particle Swarm Optimisation (DPSO) is developed as an Evolutionary Algorithm (EA) to solve network load balancing optimisation problem. The performance of DPSO is tested based on two problem scenarios and compared to Genetic Algorithm (GA) and the Exhaustive Search (ES) algorithm. The DPSO is observed to deliver optimum performance for small-scale networks and near optimum performance for large-scale networks. The DPSO has less complexity and is much faster than GA and ES algorithms. Computational results of a CDI-enabled C-RAN demonstrate significant throughput improvement compared to a fixed C-RAN, i.e., an average throughput increase of 45.53% and 42.102%, and an average blocked users reduction of 23.149%, and 20.903% is experienced for Proportional Fair (PF) and Round Robin (RR) schedulers, respectively
URI: http://bura.brunel.ac.uk/handle/2438/15403
DOI: http://dx.doi.org/10.1109/TNSM.2010.1012.1012001
Appears in Collections:Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf2.54 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.