Load Optimization of Joint User Association and Dynamic TDD in Ultra Dense Networks

被引:0
|
作者
Wei, Shouming [1 ]
Li, Ting [1 ]
Wu, Wei [1 ]
机构
[1] Harbin Inst Technol, Sch Elect & Informat Engn, Harbin, Peoples R China
基金
中国国家自然科学基金;
关键词
Ultra-dense network; Dynamic TDD; User association; Gradient descent; Two-sided matching game;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 sub-problems using the generalized Benders method. The sub-problems 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.
引用
收藏
页码:545 / 550
页数:6
相关论文
共 50 条
  • [1] Joint Optimization of User Association and Dynamic TDD for Ultra-Dense Networks
    Sapountzis, Nikolaos
    Spyropoulos, Thrasyvoulos
    Nikaein, Navid
    Salim, Umer
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2018), 2018, : 2663 - 2671
  • [2] Joint User Association and Time Partitioning for Load Balancing in Ultra-Dense Heterogeneous Networks
    Tianqing Zhou
    Junhui Zhao
    Dong Qin
    Xuan Li
    Chunguo Li
    Luxi Yang
    Mobile Networks and Applications, 2021, 26 : 909 - 922
  • [3] Joint User Association and Time Partitioning for Load Balancing in Ultra-Dense Heterogeneous Networks
    Zhou, Tianqing
    Zhao, Junhui
    Qin, Dong
    Li, Xuan
    Li, Chunguo
    Yang, Luxi
    MOBILE NETWORKS & APPLICATIONS, 2021, 26 (02): : 909 - 922
  • [4] Joint Optimization of Base Station Activation and User Association in Ultra Dense Networks Under Traffic Uncertainty
    Teng, Wei
    Sheng, Min
    Chu, Xiaoli
    Guo, Kun
    Wen, Juan
    Qiu, Zhiliang
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (09) : 6079 - 6092
  • [5] Coverage Analysis for Ultra-Dense Networks with Dynamic TDD
    Sun, Hongguang
    Yang, Rui
    Sheng, Min
    Zhang, Yan
    Liu, Jia
    Li, Jiandong
    2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
  • [6] Robust User Association for Ultra Dense Networks
    Liakopoulos, Nikolaos
    Paschos, Georgios
    Spyropoulos, Thrasyvoulos
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2018), 2018, : 2690 - 2698
  • [7] Joint User-Centric Overlapped Clustering and Load Balancing in Ultra Dense Networks
    Tao, Rui
    Chuai, Gang
    Gao, Weidong
    COMMUNICATIONS, SIGNAL PROCESSING, AND SYSTEMS, 2019, 463 : 2268 - 2279
  • [8] Dynamic User Association in Scalable Ultra-Dense LEO Satellite Networks
    Jiang, Hao
    Wang, Hai
    Hu, Yulin
    Wu, Jing
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2022, 71 (08) : 8891 - 8905
  • [9] On the Feasibility of Blind Dynamic TDD in Ultra-Dense Wireless Networks
    Celik, Haris
    Sung, Ki Won
    2015 IEEE 81ST VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), 2015,
  • [10] Joint Load-Driven Frequency Allocation and User Association in Dense Cellular Networks
    Post, Bart
    Borst, Sem
    PROCEEDINGS OF THE 2019 31ST INTERNATIONAL TELETRAFFIC CONGRESS (ITC 31), 2019, : 75 - 83