AAAlireza Alizadeh

Alireza Alizadeh

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Alireza Alizadeh has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Multi-Agent Q-Learning for Real-Time Load Balancing User Association and Handover in Mobile Networks

    by Alireza Alizadeh, Byungju Lim, Mai Vu

    As next generation cellular networks become denser, associating users with the optimal base stations at each time while ensuring no base station is overloaded becomes critical for achieving stable and high network performance. We propose multi-agent online Q-learning (QL) algorithms for performing real-time load balancing user association and handover in dense cellular networks. The load balancing constraints at all base stations couple the actions of user agents, and we propose two multi-agent action selection policies, one centralized and one distributed, to satisfy load balancing at every learning step. In the centralized policy, the actions of UEs are determined by a central load balancer (CLB) running an algorithm based on swapping the worst connection to maximize the total learning reward. In the distributed policy, each UE takes an action based on its local information by participating in a distributed matching game with the BSs to maximize the local reward. We then integrate these action selection policies into an online QL algorithm that adapts in real-time to network dynamics including channel variations and user mobility, using a reward function that considers a handover cost to reduce handover frequency. The proposed multi-agent QL algorithm features low-complexity and fast convergence, outperforming 3GPP max-SINR association. Both policies adapt well to network dynamics at various UE speed profiles from walking, running, to biking and suburban driving, illustrating their robustness and real-time adaptability.


  • Open Access

    Joint Active-Passive Beamforming and User Association in IRS-Assisted mmWave Cellular Networks

    by Ehsan Moeen Taghavi, Ramin Hashemi, Alireza Alizadeh, Nandana Rajatheva, Mai Vu, Matti Latva-Aho

    Intelligent reflecting surfaces (IRSs) are a promising technology for future-generation wireless networks by extending coverage region to blind spots and increasing mmWave propagation paths in non-line of sight environments. User association (UA) in dense millimeter wave (mmWave) networks is vital to characterizing connections among base stations (BSs) and mobile users for load balancing, interference management, and maximizing network utility. However, it has yet to be examined thoroughly in a multi-IRS-aided network. This paper presents a new UA scheme that takes cell interference into account for a multi-cell mmWave cellular network aided with multiple IRSs. We formulate a network spectral efficiency maximization problem by jointly optimizing active beamforming (AB) at the BSs, passive beamforming (PB) at the IRSs, and user-BS association with consideration of the impact of IRSs. We then propose a computationally efficient iterative algorithm based on alternating optimization (AO) to resolve this intractable mixed-integer non-convex problem. A fractional programming technique is used to optimize active beamforming at the BSs and passive beamforming at the IRSs, and a penalization method combined with successive convex programming is applied for UA optimization, which is shown to reach the optimal solution. Simulation results show significant performance improvements obtained by the proposed algorithm, providing higher spectral efficiency compared to several benchmark algorithms, while having a low computational complexity.


  • Reinforcement Learning for User Association and Handover in mmWave-Enabled Networks

    by Alireza Alizadeh, Mai Vu

    Using a multi-armed bandit technique, we propose centralized and semi-distributed online algorithms for load balancing user association and handover in mmWave-enabled networks. Load balancing at all base stations (BSs) imposes explicit constraints that makes the actions of all user equipment (UEs) co-dependent, a challenging twist to reinforcement learning. We propose a central load balancer to guarantee load balancing at all BSs for every learning step. We consider two association vectors: one for leaning update, and one best-to-date for data transmission, allowing UEs to engage in best-result data transmission while effectively participating in a background learning process indefinitely. For dynamic networks, we introduce a measurement model capturing rapid channel variations and user mobility. To minimize handover rate, we also differentiate between handover costs for transmission and for learning, and introduce a learning handover cost decreasing with sojourn time. The proposed algorithms can be implemented online as they require no offline training and can effectively adapt to network dynamics. Numerical results show that the proposed algorithms exhibit fast learning convergence and outperform 3GPP handover by achieving an order of magnitude lower handover rate at a significantly higher network sum-rate, reaching within 94-97% of the near-optimal worst connection swapping benchmark algorithm.


  • Distributed User Association in B5G Networks Using Early Acceptance Matching Game

    by Alireza Alizadeh, Mai Vu

    We study distributed user association in 5G and beyond millimeter-wave enabled heterogeneous networks using matching theory. We propose a novel and efficient distributed matching game, called early acceptance (EA), which allows users to apply for association with their ranked-preference base station in a distributed fashion and get accepted as soon as they are in the base station’s preference list with available quota. Several variants of the EA matching game with preference list updating and reapplying are compared with the original and stability-optimal deferred acceptance (DA) matching game, which implements a waiting list at each base station and delays user association until the game finishes. We show that matching stability needs not lead to optimal performance in other metrics such as throughput. Analysis and simulations show that compared to DA, the proposed EA matching games achieve higher network throughput while exhibiting a significantly faster association process. Furthermore, the EA games either playing once or multiple times can reach closely the network utility of a centralized user association while having much lower complexity.