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

Multi-IRS-aided Terahertz networks: Channel modelling and user association with imperfect CSI

Téléchargements

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

Plus de statistiques...

Rahim, Muddasir, Nguyen, Thanh Luan, Kaddoum, Georges et Do, Tri Nhu. 2024. « Multi-IRS-aided Terahertz networks: Channel modelling and user association with imperfect CSI ». IEEE Open Journal of the Communications Society, vol. 5. pp. 836-855.

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

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

Résumé

Terahertz (THz) communication is envisioned as one of the candidate technologies for future wireless communications to enable achievable data rates of up to several terabits per second (Tbps). However, the high pathloss and molecular absorption in THz band communications often limit the transmission range. To overcome these limitations, this paper proposes intelligent reconfigurable surface (IRS)-aided THz networks with imperfect channel state information (CSI). Specifically, we present an angle-based trigonometric channel model to facilitate the performance evaluation of IRS-aided THz networks. In addition, to maximize the sum rate, we formulate the transmitter (Tx)-IRS-receiver (Rx) matching problem, which is a mixed-integer nonlinear programming (MINLP) problem. To address this non-deterministic polynomial-time hard (NP-hard) problem, we propose a Gale-Shapley algorithm-based solutions to obtain stable matching between transmitters and IRSs, and receivers and IRSs, in the first and second sub-problems, respectively. The impact of the transmission power, the number of IRS elements, and the network area on the sum rate are investigated. Furthermore, the proposed algorithm is compared to an exhaustive search, nearest association, greedy search, and random allocation to validate the proposed solution. The complexity and convergence analysis demonstrate that the computational complexity of our algorithm is lower than that of the ES 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: 14 févr. 2024 19:02
Dernière modification: 11 mars 2024 16:00
URI: https://espace2.etsmtl.ca/id/eprint/28356

Actions (Authentification requise)

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