Joint radio resource and power allocation using Nash bargaining game for H‐CRAN with nonideal fronthaul links

Abstract

Heterogeneous cloud radio access network (H‐CRAN) is introduced as a novel network architecture that takes the full rewards of both heterogeneous cellular network (HCNs) and cloud radio access network (CRAN). In H‐CRAN architecture, the remote radio heads of small cells (SCs) are overlaid within the coverage of macro cell and linked to the baseband unit pool through nonideal fronthaul connections. To improve the spectral efficiency of this network, the SCs are developed to reuse the same resources used by the macro cell. However, this will introduce inter‐tier interference between macro cell and SCs and intra‐tier interference among SCs that need to be efficiently managed. In this paper, the joint problem of radio resource and power allocation in H‐CRAN is formulated using cooperative Nash bargaining game. This optimization problem is designed to maximize the total throughput of SCs, while considering the fairness between user equipments (UEs) in each SC, interference protection requirements for macro UEs, outage probability requirements, and the capacity limitation of nonideal fronthaul connections. Then, by using Lagrangian dual decomposition, the near‐optimal bargaining allocation strategy for radio resources and power of each SC UE is determined. Simulation results illustrate that the performance of the suggested algorithm outperforms the other comparable algorithm in terms of the SCs' achieved throughput and fairness. Moreover, the effect of nonideal fronthaul capacity constraint and the interference protection limit of macro UEs on the performance of the suggested scheme are examined.

Two‐timescale optimization approach for coordinated multi‐point design in unmanned aerial vehicle‐assisted cellular networks

“…The problem in (11) is challenging to solve because it is a mixed‐integer non‐linear programming (MINLP) optimization problem, which is generally NP‐hard. This problem is non‐convex even if the constraints in (11f) and (11g) is relaxed to and respectively as in Reference 23. This is because that the constraints in (11a), (11b), and (11c) are non‐convex.…”

A comprehensive survey on resource allocation for CRAN in 5G and beyond networks

“…In a CRAN, it is more challenging because the RRHs are close apart in the 5G and beyond networks and this creates significant interference problems. In addition, efficient power allocation is also important because it has a direct impact on the energy and spectral efficiency [42].…”

Energy‐efficient BBU pool virtualisation for C‐RAN with quality of service guarantees

“…C-RAN has been introduced as a promising architecture for solving the challenges of the traditional distributed RAN [3]. In C-RAN, the baseband processing units for a certain number of sites are moved into a centralised baseband unit (BBU) pool which can process the traffic for the serving sites while leaving the remote radio heads (RRHs) at the cell sites.…”

“…The RRHs are connected to the BBU pool using high bandwidth and low latency fronthaul links. Owing to the sharing of BBU pool resources by multiple RRHs in C-RAN, the cost and energy consumption are decreased compared with the legacy architecture [3].…”