Reconfigurable Multiple Access Schemes for URLLC-mMTC Coexisting Networks
Notice bibliographique
Résumé
Since the fifth generation (5G) wireless networks, the focus of machine-type communication (MTC) has shifted to emerging applications such as the Industrial Internet of Things (IIoT) and smart cities. Massive MTC (mMTC) and ultra-reliable low-latency communication (URLLC), two distinct MTC service classes targeting scalability and reliability with low latency, are expected to be merged to support diversified and more stringent quality of service (QoS) requirements in MTC beyond 5G.With limited radio resources, supporting these contrasting requirements for URLLC-mMTC coexisting networks is challenging.Multiple access schemes should consider traffic characteristics and QoS requirements to adaptively prioritize devices with urgent traffic demands while providing massive connections.Additionally, as autonomous robots are increasingly utilized in various verticals, devices with mobility are likely to cooperate as clusters or operate in out-of-coverage areas.As a result, multi-hop relay connections should be enabled to address the coverage problem and support information exchanges in different network structures.In this thesis, we propose access schemes that combine grant-based (GB) and grantfree (GF) access techniques and equip massive multiple-input-multiple-output (mMIMO) antenna array at the access point (AP) to provide reliable and low-latency transmissions while increasing device connections, targeting different cases of URLLC-mMTC coexisting networks under manifold traffic and network configurations.First, we develop an access scheme to support scalable URLLC networks that contain a large number of devices with various latency requirements.The optimization problem is formulated to maximize the system throughput while minimizing packet delay violations.Considering that the objective function is hard to derive from unknown event-based traffic statistics and different delay constraints, both single-and multi-agent reinforcement-learning (RL)-based algorithms are designed to exploit the traffic correlation and delay status to grant resources for devices with high traffic demands and stringent delay requirements and let other devices contend for transmissions.Also, an action correction mechanism is introduced to ensure better convergence and safe operation of the RL agents.Second, we propose an access scheme for critical mMTC networks, which supports URLLC services for a varying fraction of massively connected devices, and each device has regular and delay-sensitive alarm traffic simultaneously instead of a homogenous traffic type.Additionally, unlike the previous single-hop network, we consider device clusters where devices transmit to the AP by two-hop relay connections through cluster leaders, and we allocate resources dynamically to mitigate inter-cluster interference.Then, the First and foremost, I would like to express my sincere gratitude to my supervisor, Professor Tho Le-Ngoc, for his tireless guidance,
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,002 | 0,002 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,001 |
| Bibliométrie | 0,000 | 0,002 |
| Études des sciences et des technologies | 0,002 | 0,000 |
| Communication savante | 0,001 | 0,002 |
| Science ouverte | 0,004 | 0,000 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».