2018
DOI: 10.1109/access.2018.2873418
|View full text |Cite
|
Sign up to set email alerts
|

Interference Coordination and Resource Allocation Planning With Predicted Average Channel Gains for HetNets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 35 publications
0
6
0
Order By: Relevance
“…This solution achieves a relatively stable ratio of ABRB, of , and of as the number of small cells increases. Predictive ICI and RA in Het-Nets with spatial division multiple access for a fixed number of BSs and variable number of UEs is proposed in [ 39 ]. The DL data stream is divided into frames, and the algorithm determines which BS is to serve which user at each frame (interfering BSs do not transmit for its duration).…”
Section: Graph-based Ra In Cellular Homogeneous and Het-netsmentioning
confidence: 99%
“…This solution achieves a relatively stable ratio of ABRB, of , and of as the number of small cells increases. Predictive ICI and RA in Het-Nets with spatial division multiple access for a fixed number of BSs and variable number of UEs is proposed in [ 39 ]. The DL data stream is divided into frames, and the algorithm determines which BS is to serve which user at each frame (interfering BSs do not transmit for its duration).…”
Section: Graph-based Ra In Cellular Homogeneous and Het-netsmentioning
confidence: 99%
“…Consider zero-forcing precoder, then the multi-user interference in ( 8) can be completely avoided if K max ≤ N tx . From the analysis in [19] and [26], the average SINR in the f th frame can be approximated aŝ…”
Section: ) Problem Simplificationmentioning
confidence: 99%
“…When ( 19) is unsatisfied, BS g should allocate more than m f * k,g RBs to UE k by borrowing RBs from other users. We know that for UE k , except the required RBs to meet (19), the average number of remaining RBs can be estimated asm f * k,g − R f,th k,g /r f k,g . Considering that users with more remaining RBs are easier to meet the QoS requirements, the user whose reserved RBs are not enough can borrow RBs from the ones with abundant remaining RBs.…”
Section: ) Problem Simplificationmentioning
confidence: 99%
See 2 more Smart Citations