TY - GEN
T1 - Load Optimization of Joint User Association and Dynamic TDD in Ultra Dense Networks
AU - Wei, Shouming
AU - Li, Ting
AU - Wu, Wei
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/6
Y1 - 2020/6
N2 - In order to adapt to the rising traffic in 5G even 6G systems, operators have turned their attention to the dense deployment of base stations, which makes the problem of user association more complicated. At the same time, in order to adapt to the differences of traffic in different regions and the asymmetry of uplink and downlink requirement, dynamic TDD technology has also been proposed in some papers. Hence, dynamic TDD based Ultra-dense networks require more complex association algorithms, and these algorithms should consider not only the channel characteristics, but also the load of the base stations and the uplink and downlink resource configuration of the base stations. Although some researches have been done on user association and dynamic TDD, most papers consider them separately. In this paper, we consider user association and dynamic TDD together and add constraints on cross-slot interference and load limits. We propose an algorithm which can decompose the problem into independent subproblems using the generalized Benders method. The subproblems can be solved by the gradient descent algorithm and two-sided matching game algorithm, respectively. Simulation results show that compared with traditional algorithms, our proposed algorithm can significantly improve the performance of user throughput and network load balancing.
AB - In order to adapt to the rising traffic in 5G even 6G systems, operators have turned their attention to the dense deployment of base stations, which makes the problem of user association more complicated. At the same time, in order to adapt to the differences of traffic in different regions and the asymmetry of uplink and downlink requirement, dynamic TDD technology has also been proposed in some papers. Hence, dynamic TDD based Ultra-dense networks require more complex association algorithms, and these algorithms should consider not only the channel characteristics, but also the load of the base stations and the uplink and downlink resource configuration of the base stations. Although some researches have been done on user association and dynamic TDD, most papers consider them separately. In this paper, we consider user association and dynamic TDD together and add constraints on cross-slot interference and load limits. We propose an algorithm which can decompose the problem into independent subproblems using the generalized Benders method. The subproblems can be solved by the gradient descent algorithm and two-sided matching game algorithm, respectively. Simulation results show that compared with traditional algorithms, our proposed algorithm can significantly improve the performance of user throughput and network load balancing.
KW - Dynamic TDD
KW - Gradient descent
KW - Two-sided matching game
KW - Ultra-dense network
KW - User association
UR - https://www.scopus.com/pages/publications/85089675078
U2 - 10.1109/IWCMC48107.2020.9148372
DO - 10.1109/IWCMC48107.2020.9148372
M3 - 会议稿件
AN - SCOPUS:85089675078
T3 - 2020 International Wireless Communications and Mobile Computing, IWCMC 2020
SP - 545
EP - 550
BT - 2020 International Wireless Communications and Mobile Computing, IWCMC 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 16th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2020
Y2 - 15 June 2020 through 19 June 2020
ER -