2014
DOI: 10.1109/tvt.2013.2290125
|View full text |Cite
|
Sign up to set email alerts
|

Cluster-Based Resource Management in OFDMA Femtocell Networks With <roman>QoS</roman> Guarantees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
84
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 86 publications
(85 citation statements)
references
References 27 publications
0
84
0
Order By: Relevance
“…The system overhead and transmission delay caused by PRB switching should be minimized as much as possible. Here, we give a scheduling case comparison of the clusteringbased interference coordination algorithm [16] and the graph coloring algorithm [27] to our algorithm based on the allocation in Fig. 5 to analyze and contrast transmission delay and signaling overheads.…”
Section: Resource Scheduling Examplementioning
confidence: 99%
See 1 more Smart Citation
“…The system overhead and transmission delay caused by PRB switching should be minimized as much as possible. Here, we give a scheduling case comparison of the clusteringbased interference coordination algorithm [16] and the graph coloring algorithm [27] to our algorithm based on the allocation in Fig. 5 to analyze and contrast transmission delay and signaling overheads.…”
Section: Resource Scheduling Examplementioning
confidence: 99%
“…To minimize ISI and ensure users' quality of service, some academics have used small cell clustering to coordinate cluster members' resource allocation. Considering graph theory, a clustering-based interference coordination heuristic algorithm was proposed in [14][15][16], which forms clusters dynamically and divides resource allocation into three phases to minimize ISI: (1) cluster formation; (2) intracluster resource allocation and admission control; and (3) inter-cluster resource contention resolution, in order to minimize ISI. It is worth noting that in this model, the formation of a given cluster is updated only when the interference caused by the changes in the user number exceeds a given threshold.…”
Section: Introductionmentioning
confidence: 99%
“…Note that problem (7) has been demonstrated to be NP-hard [5]. To solve it, we propose to divide it into three subproblems through clustering.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Nevertheless, the computation complexity of clustering algorithms has typically proven to be too high [5]. To reduce the complexity of clustering, we propose here a suboptimal clustering mechanism called SDC.…”
Section: Partial Observation Markov Decision Process-based Semi-dynammentioning
confidence: 99%
See 1 more Smart Citation