A Generic Polynomial-Time Cell Association Scheme in Ultra-Dense Cellular Networks
- 183 Downloads
Cell association in heterogeneous cellular networks is a significant research issue, but existing schemes mainly optimize a single objective and could not solve such a problem with a generic utility function in polynomial time. This paper proposes a cell association scheme for generic optimization objectives with polynomial-time complexity, which employs a virtual base station method to transform it into a 2-dimensional assignment problem solved by Hungarian algorithm. Based on this scheme, a framework for the tradeoff among multiple optimization objectives is designed. This framework jointly considers spectral efficiency and load balancing, designs a weight factor to adjust their impacts on the optimization, and uses an experience pool to store the relationship between performance demands and corresponding weight factor values. For an instantaneous cell association decision in a given network scenario, the association results are obtained as soon as the corresponding factor value is taken from the pool and the Hungarian algorithm is called for the matching. Compared with existing schemes, our proposal achieves a better tradeoff between system capacity and UE fairness with an extremely low time cost.
KeywordsHeterogeneous cellular networks Cell association 2-dimensional assignment problem Hungarian algorithm Fairness
This work was funded by the Fundamental Research Funds for the Central Universities of China under grant no. PA2019GDQT0012.
- 9.Zhao, N., Liang, Y., Niyato, D., Pei, Y., Wu, M., Jiang, Y.: Deep reinforcement learning for user association and resource allocation in heterogeneous cellular networks. IEEE Trans. Wirel. Commun. (in press)Google Scholar
- 10.Wang, W., Wu, X., Xie, L., Lu, S.: Femto-matching: efficient traffic offloading in heterogeneous cellular networks. In: IEEE INFOCOM, pp. 325–333. IEEE, Hong Kong (2015)Google Scholar