2018 Global Information Infrastructure and Networking Symposium (GIIS) 2018
DOI: 10.1109/giis.2018.8635647
|View full text |Cite
|
Sign up to set email alerts
|

Throughput-Aware RRHs Clustering in Cloud Radio Access Networks

Abstract: Cloud-Radio Access Network (C-RAN) is an attractive solution to Mobile Network Operators. Firstly, C-RAN leverages the effect of pooling multiple Baseband Units (BBUs) to offer centralized processing resources while hosting them on cloud. This results in multiple benefits ranging from statistical multiplexing gains, to energy efficiency. Secondly, C-RAN allows deploying Remote Radio Heads (RRHs) in proximity of end-users allowing exploiting Inter-Cell Interference Cancellation (ICIC) to maximize throughput by … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 13 publications
0
8
0
Order By: Relevance
“…The impact of all the above parameters on the system cost was compared while comparing the proposed method with the optimal ILP by using CPLEX and the nearest-first scheme. In [63], the proposed heuristic for solving the k-MCKP-based clustering technique was simulated via Monte Carlo simulation in MATLAB. Then, the performance was compared with the optimal solution and two no-clustering approaches (no-clustering upper bound and no-clustering lower bound) in terms of the end-user throughput, spectral efficiency, and execution time.…”
Section: Evaluation Techniques For Rrh Clustering Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The impact of all the above parameters on the system cost was compared while comparing the proposed method with the optimal ILP by using CPLEX and the nearest-first scheme. In [63], the proposed heuristic for solving the k-MCKP-based clustering technique was simulated via Monte Carlo simulation in MATLAB. Then, the performance was compared with the optimal solution and two no-clustering approaches (no-clustering upper bound and no-clustering lower bound) in terms of the end-user throughput, spectral efficiency, and execution time.…”
Section: Evaluation Techniques For Rrh Clustering Methodsmentioning
confidence: 99%
“…Salhab et al investigated a throughput-aware RRH clustering problem with the objective of maximizing the throughput for end-users by maintaining multiple constraints on BBU resources [63]. A two-stage approach was proposed.…”
Section: Throughput-aware Rrh Clusteringmentioning
confidence: 99%
“…Problem Formulation and Resolution: Based on our previous work in [20], we formalize the "Admission Control" problem as D-dimensional Multiple-Choice Knapsack problem that is constrained by multiple limits stipulated by each slice type. The problem can be formalized as follows.…”
Section: Admission Controllermentioning
confidence: 99%
“…To solve this NP-hard problem, we can use our polynomial time heuristic algorithm proposed in our previous work in [20].…”
Section: Admission Controllermentioning
confidence: 99%
See 1 more Smart Citation