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 条
  • [41] Classification of Monte Carlo Tree Search Variants
    McGuinness, Cameron
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 357 - 363
  • [42] Trajectory Optimization with Monte Carlo Tree Search Based AI for VMAT
    Dong, P.
    Liu, H.
    Xing, L.
    MEDICAL PHYSICS, 2017, 44 (06) : 3133 - 3133
  • [43] αβ-based Play-outs in Monte-Carlo Tree Search
    Winands, Mark H. M.
    Bjornsson, Yngvi
    2011 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND GAMES (CIG), 2011, : 110 - 117
  • [44] The Monte Carlo tree search based bandwidth slicing allocation algorithm
    Chang, Shun-Chieh
    WIRELESS NETWORKS, 2024, 30 (02) : 835 - 844
  • [45] Path Exploration Based on Monte Carlo Tree Search for Symbolic Execution
    Yeh, Chao-Chun
    Lu, Han-Lin
    Yeh, Jia-Jun
    Huang, Shih-Kun
    2017 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 2017, : 33 - 37
  • [46] The Monte Carlo tree search based bandwidth slicing allocation algorithm
    Shun-Chieh Chang
    Wireless Networks, 2024, 30 : 835 - 844
  • [47] Ancestor-Based α-β Bounds for Monte-Carlo Tree Search
    Pepels, Tom
    Winands, Mark H. M.
    2024 IEEE CONFERENCE ON GAMES, COG 2024, 2024,
  • [48] A Timetable Rescheduling Approach for Railway based on Monte Carlo Tree Search
    Wang, Rongsheng
    Zhou, Min
    Li, Yidong
    Zhang, Qi
    Dong, Hairong
    2019 IEEE INTELLIGENT TRANSPORTATION SYSTEMS CONFERENCE (ITSC), 2019, : 3738 - 3743
  • [49] Monte-Carlo Tree Search with Tree Shape Control
    Marchenko, Oleksandr I.
    Marchenko, Oleksii O.
    2017 IEEE FIRST UKRAINE CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (UKRCON), 2017, : 812 - 817
  • [50] Fast and Accurate User Cold-Start Learning Using Monte Carlo Tree Search
    Rajapakse, Dilina Chandika
    Leith, Douglas
    PROCEEDINGS OF THE 16TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, RECSYS 2022, 2022, : 350 - 359