ENGLISH
La vitrine de diffusion des publications et contributions des chercheurs de l'ÉTS
RECHERCHER

Deep reinforcement learning approach for HAPS user scheduling in massive MIMO communications

Téléchargements

Téléchargements par mois depuis la dernière année

Plus de statistiques...

Sharifi, Sara, Khoshkbari, Hesam, Kaddoum, Georges et Akhrif, Ouassima. 2024. « Deep reinforcement learning approach for HAPS user scheduling in massive MIMO communications ». IEEE Open Journal of the Communications Society, vol. 5. pp. 1-14.

[thumbnail of Kaddoum-G-2024-28181.pdf]
Prévisualisation
PDF
Kaddoum-G-2024-28181.pdf - Version publiée
Licence d'utilisation : Creative Commons CC BY-NC-ND.

Télécharger (1MB) | Prévisualisation

Résumé

In this paper, we devise a deep SARSA reinforcement learning (DSRL) user scheduling algorithm for a base station (BS) that uses a high-altitude platform station (HAPS) as a backup to serve multiple users in a wireless cellular network. Considering a realistic scenario, we assume that only the outdated channel state information (CSI) of the terrestrial base station (TBS) is available in our defined user scheduling problem. We model this user scheduling problem using a Markov decision process (MDP) framework, aiming to maximize the sum-rate while minimizing the number of active antennas at the HAPS. Our performance analysis shows that the sum-rate obtained with our proposed DSRL algorithm is close to the optimal sum-rate achieved with an exhaustive search method. We also develop a heuristic optimization method to solve the user scheduling problem at the BS. We show that for a scenario where perfect CSI is not available, our proposed DSRL algorithm outperforms the heuristic optimization method.

Type de document: Article publié dans une revue, révisé par les pairs
Professeur:
Professeur
Kaddoum, Georges
Affiliation: Génie électrique
Date de dépôt: 18 déc. 2023 19:07
Dernière modification: 08 janv. 2024 20:09
URI: https://espace2.etsmtl.ca/id/eprint/28181

Actions (Authentification requise)

Dernière vérification avant le dépôt Dernière vérification avant le dépôt