In cellular networks, User Equipment (UE) handoff from one Base Station (BS) to another, giving rise to the load balancing problem among the BSs. To address this problem, BSs can work collaboratively to deliver a smooth migration (or handoff) and satisfy the UEs' service requirements. This paper formulates the load balancing problem as a Markov game and proposes a Robust Multi-agent Attention Actor-Critic (Robust-MA3C) algorithm that can facilitate collaboration among the BSs (i.e., agents). In particular, to solve the Markov game and find a Nash equilibrium policy, we embrace the idea of adopting a nature agent to model the system uncertainty. Moreover, we utilize the self-attention mechanism, which encourages high-performance BSs to assist low-performance BSs. In addition, we consider two types of schemes, which can facilitate load balancing for both active UEs and idle UEs. We carry out extensive evaluations by simulations, and simulation results illustrate that, compared to the state-of-the-art MARL methods, Robust-\ours~scheme can improve the overall performance by up to 45%.
翻译:在蜂窝网络中,用户设备(UE)从一个基地站(BS)到另一个基地站(BS)的用户设备(UE)从一个基地站(BS)到另一个基地站(BS),造成BS之间的负平衡问题。为了解决这个问题,BS可以合作工作,顺利迁移(或交接)并满足UES的服务要求。本文将负平衡问题描述为Markov游戏,并提议一种可促进BS(即代理商)之间合作的强力多试剂注意动作(Robust-MA3C)算法。特别是为了解决Markov游戏并找到纳什平衡政策,我们赞同采用自然剂来模拟系统不确定性的想法。此外,我们利用鼓励高性能BS的自我注意机制来帮助低性能BS。此外,我们考虑两种类型的办法,可以促进活跃的US和闲置的UE(Robust-MA3C)之间的负载平衡。我们通过模拟进行广泛的评价,模拟结果表明,与最先进的MARL方法相比,Robust-%-我们的总体性能改进整个性能到45。</s>