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 条
  • [1] Treemap Layout Based on Monte Carlo Tree Search
    Liu, Tingting
    Wang, Yunhai
    Tu, Changhe
    Jiang, Peng
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2021, 33 (09): : 1367 - 1376
  • [2] Preference-Based Monte Carlo Tree Search
    Joppen, Tobias
    Wirth, Christian
    Fuernkranz, Johannes
    KI 2018: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, 11117 : 327 - 340
  • [3] Multiagent Monte Carlo Tree Search
    Zerbel, Nicholas
    Yliniemi, Logan
    AAMAS '19: PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2019, : 2309 - 2311
  • [4] Monte Carlo Tree Search with Metaheuristics
    Mandziuk, Jacek
    Walczak, Patryk
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, ICAISC 2023, PT II, 2023, 14126 : 134 - 144
  • [5] Elastic Monte Carlo Tree Search
    Xu, Linjie
    Dockhorn, Alexander
    Perez-Liebana, Diego
    IEEE TRANSACTIONS ON GAMES, 2023, 15 (04) : 527 - 537
  • [6] Monte Carlo Tree Search in Hex
    Arneson, Broderick
    Hayward, Ryan B.
    Henderson, Philip
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2010, 2 (04) : 251 - 258
  • [7] Load Balancing and User Association Based on Historical Data
    Zhang, Yuejie
    Sun, Kai
    Gao, Xueliang
    Huang, Wei
    Zhang, Haijun
    2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
  • [8] Monte Carlo tree search in Kriegspiel
    Ciancarini, Paolo
    Favini, Gian Piero
    ARTIFICIAL INTELLIGENCE, 2010, 174 (11) : 670 - 684
  • [9] MONTE CARLO TREE SEARCH: A TUTORIAL
    Fu, Michael C.
    2018 WINTER SIMULATION CONFERENCE (WSC), 2018, : 222 - 236
  • [10] Monte Carlo Tree Search for Quoridor
    Respall, Victor Massague
    Brown, Joseph Alexander
    Aslam, Hamna
    19TH INTERNATIONAL CONFERENCE ON INTELLIGENT GAMES AND SIMULATION (GAME-ON(R) 2018), 2018, : 5 - 9