Next-generation wireless networks (NGWNs) aim to deliver seamless connectivity through unified architectures spanning cellular, Wi-Fi, and non-terrestrial systems. This integration worsens resource-optimization challenges, as dense, heterogeneous depl...
Next-generation wireless networks (NGWNs) aim to deliver seamless connectivity through unified architectures spanning cellular, Wi-Fi, and non-terrestrial systems. This integration worsens resource-optimization challenges, as dense, heterogeneous deployments and dynamic traffic require rapid and scalable decision-making. Centralized or model-driven methods struggle under these conditions, leading to inefficiencies and QoS degradation. Distributed approaches that can reason about interdependent network decisions and adapt online are therefore essential. Game-theoretic models capture strategic interactions and promote stable, efficient operating points, while learning-based methods provide the agility needed under uncertainty—together forming a strong basis for autonomous resource optimization in NGWNs.
In Part I, we develop a distributed load balancing algorithm for multi-radio access technology (multi-RAT) heterogeneous networks (HetNets). The random deployment of small cells and the user mobility make the network load distribution uneven, which degrades overall network capacity and the QoS for users. Furthermore, the disparate capabilities of multiple RATs such as the different propagation delays in terrestrial and non-terrestrial RATs affect the latency requirements. To balance the network load in multi-RAT HetNets, we propose a distributed game-theoretic algorithm considering QoS for users. To that end, a cost function is defined to reflect the cell load status, required data rates, and delay constraints. In the proposed algorithm, overloaded cells iteratively minimize user cost in a distributed manner by associating a user with a less-loaded cell based on its cost. We provide analysis to show that minimizing each user cost in the game theory setting achieves a balanced load distribution among cells. We show that the proposed algorithm brings each cell load to a balanced state in a finite number of iterations. Using simulation, we show that the proposed algorithm achieves superior performance in terms of even load distribution, network throughput, and the number of users with satisfactory QoS.
In Part II, we develop a load-aware, load-balancing procedure for fifth-generation (5G) New Radio-Unlicensed (NR-U) networks in order to address performance degradation and resource inefficiencies caused by load imbalance. Load imbalances frequently occur in NR-U networks due to factors such as the dynamic spectrum, user mobility, and varying traffic demand. To tackle these challenges, a load-aware, load-balancing procedure utilizing game theoretic reinforcement learning (GT-RL) is introduced. For load awareness, an extended System Information Block (SIB) is incorporated within the framework of 5G wireless networks. The load-balancing problem is addressed as a game theoretic cost-minimization task combining conditional offloading with reinforcement learning traffic-steering to dynamically distribute loads. Reinforcement learning applies a game theoretic policy to move users from overloaded cells to less congested cells that best serve their needs. Analytically, the proposed method is proven to spread the network load toward equilibrium. The proposed method is validated through simulations that show the effectiveness of its load balancing. The proposed method achieved better performance than previous work by attaining lower load variances while achieving higher throughput and greater quality of service satisfaction. Especially under high-load dynamics, the proposed method achieved an 8% gain in UE satisfaction with QoS and a 7.61% gain in network throughput compared to existing RL-based approach, whereas compared to the non-AI approaches, UE QoS satisfaction and the network throughput were enhanced by more than 15%.