ENGLISH
La vitrine de diffusion des publications et contributions des chercheurs(-euses) de l'ÉTS
RECHERCHER

Dynamic resource allocation in IRS-assisted hybrid mmWave and THz networks for eURLLC and FeMBB services

Rahim, Muddasir et Kaddoum, Georges. 2026. « Dynamic resource allocation in IRS-assisted hybrid mmWave and THz networks for eURLLC and FeMBB services ». IEEE Open Journal of the Communications Society, vol. 7. pp. 3288-3304.

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

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

Résumé

This paper examines the coexistence of further enhanced mobile broadband (FeMBB) and extreme ultra-reliable low-latency communication (eURLLC) services within an intelligent reconfigurable surface (IRS)-assisted hybrid millimeter wave (mmWave) and terahertz (THz) network. To avoid the obstruction of the line-of-sight (LOS) link, we propose a hybrid deployment scheme that combines terrestrial IRSs and aerial IRSs. Additionally, we introduce a sub-IRS concept, dividing the IRS into multiple sub-IRSs to serve multiple users. The coexistence of FeMBB and eURLLC services in the same network poses a significant resource allocation (RA) challenge. To address this, we propose a multi-objective optimization problem that jointly optimizes power, user, and service allocations. The goal is to maximize the FeMBB data rate and eURLLC reliability, which is a challenging NP-hard mixed-integer nonlinear programming problem. To solve this, we employ a weighted sum method to convert it into a single-objective optimization problem, decomposing it into FeMBB and eURLLC RA sub-problems. Specifically, we introduce a many-to-many matching game to allocate IRSs to FeMBB users. Simulation results demonstrate the superior performance of the proposed scheme over baseline methods. Additionally, the proposed algorithm’s sum rate for FeMBB users closely approximates that of an exhaustive search method but with significantly lower computational complexity.

Type de document: Article publié dans une revue, révisé par les pairs
Chercheur(-euse):
Chercheur(-euse)
Kaddoum, Georges
Affiliation: Génie des systèmes
Date de dépôt: 29 avr. 2026 15:48
Dernière modification: 22 mai 2026 21:10
URI: https://espace2.etsmtl.ca/id/eprint/33680

Actions (Authentification requise)

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