User Association and Load Balancing Based on Monte Carlo Tree Search

被引:3
|
作者
Yoo, Hyeon-Min [1 ]
Moon, Jung-Mo [2 ]
Na, Jeehyeon [2 ]
Hong, Een-Kee [1 ]
机构
[1] Kyung Hee Univ, Dept Elect & Informat Convergence Engn, Yongin 17104, South Korea
[2] Elect & Telecommun Res Inst, Intelligent Small Cell Res Ctr, Daejeon 34129, South Korea
关键词
Load management; Computer architecture; Heuristic algorithms; 5G mobile communication; Monte Carlo methods; Computational complexity; Base stations; User experience; User association; ultra-dense heterogeneous network; load balancing; Monte Carlo tree search; cell range expansion; CELL ASSOCIATION; NETWORKS; HETNETS; DOWNLINK;
D O I
10.1109/ACCESS.2023.3330872
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The user association algorithm for 5G ultra-dense heterogeneous networks (UD-HetNets) comprising multi-tier base stations is becoming increasingly complex. In UD-HetNets, small base stations (SBSs) play an important role in offloading data traffic of user equipments (UEs) requiring high data rate from macro base stations (MBSs) to enhance the quality of services (QoS) of them. However, the traditional cell range expansion (CRE) scheme poses a risk of congestion in certain SBSs and the emergence of UEs monopolizing resources in less congested SBSs, which causes SBS load imbalance and decreases fairness performance. At the same time, determining the optimal user association result for load balancing, considering all possible combinations of associations between UEs and SBSs, leads to prohibitively high computational complexity. To obtain a near-optimal user association solution with manageable computational complexity, in this paper, we propose a heuristic algorithm based on Monte Carlo tree search (MCTS) for user association in UD-HetNet. We model the user association problem as a combinatorial optimization problem and provide a detailed design of the MCTS steps to solve this NP-hard problem. The MCTS algorithm obtains a near-optimal UEs-SBSs combination in terms of load balancing and maximizes the fairness of the overall network. This combination derived from the proposed algorithm aims to achieve load balancing among SBSs and mitigate resource monopolization among UEs. The simulation results show that the proposed algorithm outperforms conventional user association schemes in terms of fairness. As a result, compared to traditional CRE schemes, the proposed method can provide good performance to the UEs receiving data rates of the bottom 50%. Furthermore, the gap between optimal and heuristic solutions does not exceed 4%. Due to its manageable computational complexity, the proposed algorithm can be implemented as an xApp on the O-RAN near-real-time RAN intelligent controller (RIC).
引用
收藏
页码:126087 / 126097
页数:11
相关论文
共 50 条
  • [31] Monte Carlo Tree Search for Love Letter
    Omarov, Tamirlan
    Aslam, Hamna
    Brown, Joseph Alexander
    Reading, Elizabeth
    19TH INTERNATIONAL CONFERENCE ON INTELLIGENT GAMES AND SIMULATION (GAME-ON(R) 2018), 2018, : 10 - 15
  • [32] Incentive Learning in Monte Carlo Tree Search
    Kao, Kuo-Yuan
    Wu, I-Chen
    Yen, Shi-Jim
    Shan, Yi-Chang
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2013, 5 (04) : 346 - 352
  • [33] Monte Carlo Tree Search With Reversibility Compression
    Cook, Michael
    2021 IEEE CONFERENCE ON GAMES (COG), 2021, : 556 - 563
  • [34] Time Management for Monte Carlo Tree Search
    Baier, Hendrik
    Winands, Mark H. M.
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2016, 8 (03) : 301 - 314
  • [35] Parallel Monte-Carlo Tree Search
    Chaslot, Guillaume M. J. -B.
    Winands, Mark H. M.
    van den Herik, H. Jaap
    COMPUTERS AND GAMES, 2008, 5131 : 60 - +
  • [36] Parallel Monte Carlo Tree Search on GPU
    Rocki, Kamil
    Suda, Reiji
    ELEVENTH SCANDINAVIAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (SCAI 2011), 2011, 227 : 80 - 89
  • [37] Monte Carlo Tree Search in Lines of Action
    Winands, Mark H. M.
    Bjornsson, Yngvi
    Saito, Jahn-Takeshi
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2010, 2 (04) : 239 - 250
  • [38] Monte-Carlo Tree Search Solver
    Winands, Mark H. M.
    Bjornsson, Yngvi
    Saito, Jahn-Takeshi
    COMPUTERS AND GAMES, 2008, 5131 : 25 - +
  • [39] Text Matching with Monte Carlo Tree Search
    He, Yixuan
    Tao, Shuchang
    Xu, Jun
    Guo, Jiafeng
    Lan, YanYan
    Cheng, Xueqi
    INFORMATION RETRIEVAL, CCIR 2018, 2018, 11168 : 41 - 52
  • [40] Monte Carlo Tree Search with Boltzmann Exploration
    Painter, Michael
    Baioumy, Mohamed
    Hawes, Nick
    Lacerda, Bruno
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,