.png){kind=icon}
.png){kind=icon}
Return
Distributed User Association and Resource Allocation Algorithms for Three Tier HetNets
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2020.3017519.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we consider joint optimization of user association and resource allocation in three tier HetNets. We formulate the objective of minimizing the resources required to clear a given set of files, as a linear program. We show that the optimal user association is determined by a rate-biasing rule, where a bias value is associated with each BS. We show that each rate-bias value crucially only takes values from a finite set which we characterize. We present a complete analytical solution along with new structural results. Using these results, we present efficient distributed algorithms for optimal control of three tier HetNets. The method involves a 1D search for a resource variable at the macro-level, and 2D search at the pico-level for a resource variable and a bias value. We apply our results to a variety of hierarchical network examples.
Keywords:
Interference
Wireless communication
Resource management
Optimization
5G mobile communication
Real-time systems
Complexity theory
HetNets
multi-tier
user association
Cell Range Expansion (CRE)
interference management
eICIC
small cells
mm-wave
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W