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 条
  • [21] Monte Carlo Tree Search for Trading and Hedging
    Vittori, Edoardo
    Likmeta, Amarildo
    Restelli, Marcello
    ICAIF 2021: THE SECOND ACM INTERNATIONAL CONFERENCE ON AI IN FINANCE, 2021,
  • [22] A Survey of Monte Carlo Tree Search Methods
    Browne, Cameron B.
    Powley, Edward
    Whitehouse, Daniel
    Lucas, Simon M.
    Cowling, Peter I.
    Rohlfshagen, Philipp
    Tavener, Stephen
    Perez, Diego
    Samothrakis, Spyridon
    Colton, Simon
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2012, 4 (01) : 1 - 43
  • [23] Nonasymptotic Analysis of Monte Carlo Tree Search
    Shah, Devavrat
    Xie, Qiaomin
    Xu, Zhi
    OPERATIONS RESEARCH, 2022, 70 (06) : 3234 - 3260
  • [24] Information Set Monte Carlo Tree Search
    Cowling, Peter I.
    Powley, Edward J.
    Whitehouse, Daniel
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2012, 4 (02) : 120 - 143
  • [25] State Aggregation in Monte Carlo Tree Search
    Hostetler, Jesse
    Fern, Alan
    Dietterich, Tom
    PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 2446 - 2452
  • [26] Monte Carlo Tree Search with Robust Exploration
    Imagawa, Takahisa
    Kaneko, Tomoyuki
    COMPUTERS AND GAMES, CG 2016, 2016, 10068 : 34 - 46
  • [27] Multiple Pass Monte Carlo Tree Search
    McGuinness, Cameron
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 1555 - 1561
  • [28] On Monte Carlo Tree Search and Reinforcement Learning
    Vodopivec, Tom
    Samothrakis, Spyridon
    Ster, Branko
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 60 : 881 - 936
  • [29] Learning in POMDPs with Monte Carlo Tree Search
    Katt, Sammie
    Oliehoek, Frans A.
    Amato, Christopher
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [30] Playing Carcassonne with Monte Carlo Tree Search
    Ameneyro, Fred Valdez
    Galvan, Edgar
    Fernando, Angel
    Morales, Kuri
    2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 2343 - 2350