Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/12145
Title: Multi-Agent Rl for Sleep Mode and Antenna Configuration With User Offloading Under Dynamic Traffic in Massive Mimo Networks
Authors: Zhang, S.
Cai, T.
Demir, O.T.
Cavdar, C.
Keywords: Antenna Switching
Base Station Control For Energy Savings
Green Networks
Massive Mimo
Multi-Agent Reinforcement Learning
Publisher: Institute of Electrical and Electronics Engineers Inc.
Abstract: In this paper, we focus on minimizing the total energy consumption of multi-cell massive multiple-input multiple-output (MIMO) networks while simultaneously guaranteeing user quality of service (QoS). This is achieved by optimizing the multi-level advanced sleep modes (ASM), antenna switching, and user association of the base stations (BSs). Due to the interdependence of user association and inter-cell interference in the network, collaborative efforts among individual BSs become imperative. The problem is modeled as a decentralized partially observable Markov decision process (DEC-POMDP) and a multi-agent proximal policy optimization (MAPPO) algorithm is proposed to obtain a collaborative BS control policy. Simulation results demonstrate that the obtained policy can significantly improve network energy efficiency, adaptively switch the BSs into different depths of sleep, reduce inter-cell interference, and maintain good QoS compared to the two benchmark algorithms. The results also validate that enabling user offloading among BSs can improve both user QoS and system performance. The superiority of MAPPO is further affirmed by comparing it with the single-agent deep Q network (DQN) algorithm. © 1967-2012 IEEE.
URI: https://doi.org/10.1109/TVT.2025.3541136
https://hdl.handle.net/20.500.11851/12145
ISSN: 0018-9545
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Show full item record



CORE Recommender

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.