%0 Conference Paper %1 pos19ITC31 %A Post, Bart %A Borst, Sem %B 31th International Teletraffic Congress (ITC 31) %C Budapest, Hungary %D 2019 %K itc itc31 %T Joint Load-Driven Frequency Allocation and User Association in Dense Cellular Networks %U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc31/pos19ITC31.pdf?inline=true %X Fuelled by the proliferation of smartphones, wireless traffic has experienced huge growth, which will continue and exacerbate the capacity strain in cellular networks. Network densification has emerged as a powerful paradigm to boost spectral efficiency and accommodate the continual rise in demand for wireless capacity. These dense networks also make resource allocation more challenging though, as they result in more irregular cells with possibly overlapping coverage areas and greater variability in traffic loads. To deal with these load imbalances, there are typically two methods to dynamically match capacity and demand: ``bring users to capacity'' (user association) and ``bring capacity to the users'' (frequency/spectrum allocation). In this paper we study the joint operation of load-aware dynamic user association and frequency allocation algorithms in dense cellular networks. Motivated by a joint load-balancing optimization problem, we consider load-aware algorithms that operate using load measurements at the access points (APs) and can react to changing load conditions without knowledge of difficult-to-obtain system parameters. We present extensive simulation results for various parameter settings, allowing for the user association and frequency allocation algorithms to operate on different time scales. The simulation results show that the joint operation of these algorithms leads to excellent performance without the need to provide an initialized and optimized frequency allocation.

@inproceedings{pos19ITC31, abstract = {Fuelled by the proliferation of smartphones, wireless traffic has experienced huge growth, which will continue and exacerbate the capacity strain in cellular networks. Network densification has emerged as a powerful paradigm to boost spectral efficiency and accommodate the continual rise in demand for wireless capacity. These dense networks also make resource allocation more challenging though, as they result in more irregular cells with possibly overlapping coverage areas and greater variability in traffic loads. To deal with these load imbalances, there are typically two methods to dynamically match capacity and demand: ``bring users to capacity'' (user association) and ``bring capacity to the users'' (frequency/spectrum allocation). In this paper we study the joint operation of load-aware dynamic user association and frequency allocation algorithms in dense cellular networks. Motivated by a joint load-balancing optimization problem, we consider load-aware algorithms that operate using load measurements at the access points (APs) and can react to changing load conditions without knowledge of difficult-to-obtain system parameters. We present extensive simulation results for various parameter settings, allowing for the user association and frequency allocation algorithms to operate on different time scales. The simulation results show that the joint operation of these algorithms leads to excellent performance without the need to provide an initialized and optimized frequency allocation.}, added-at = {2020-04-29T15:29:04.000+0200}, address = {Budapest, Hungary}, author = {Post, Bart and Borst, Sem}, biburl = {https://www.bibsonomy.org/bibtex/2942fce4f6ae7e5e88c5340cf60fb3229/itc}, booktitle = {31th International Teletraffic Congress (ITC 31)}, interhash = {78dfacec6898bfbfdd66973a0aa36c83}, intrahash = {942fce4f6ae7e5e88c5340cf60fb3229}, keywords = {itc itc31}, timestamp = {2020-04-30T18:18:45.000+0200}, title = {Joint Load-Driven Frequency Allocation and User Association in Dense Cellular Networks}, url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc31/pos19ITC31.pdf?inline=true}, year = 2019 }