MétaCan
Menu
Retour à la cohorte
Enregistrement W6966574591 · doi:10.48336/f829-nd34

Reflective intelligence surface technology for future wireless networks

2023· article· en· W6966574591 sur OpenAlexaff

Notice bibliographique

RevueMemorial University Research Repository (Memorial University) · 2023
Typearticle
Langueen
DomaineEngineering
ThématiqueAdvanced Wireless Communication Technologies
Établissements canadiensMemorial University of Newfoundland
Organismes subventionnairesnon disponible
Mots-clésWirelessWireless networkInterference (communication)Reinforcement learningSoftware deploymentPhase (matter)Communications system

Résumé

récupéré en direct d'OpenAlex

Reconfigurable intelligent surfaces (RISs) have witnessed significant attention due to their potential to improve the efficiency and coverage of wireless networks. RIS acts as a smart mirror, which reconfigures the wireless propagation environment by tuning the incoming waveform’s phase shift, amplitude, and polarization. To fully realize the capabilities of RIS, the phase shifts should be efficiently optimized. Researchers have considered optimization-based techniques to tackle the phase shift optimization problem. However, such methods are complex in nature and are difficult to realize for large-scale systems. To this end, deep reinforcement learning (DRL) has emerged as a robust and powerful approach for optimizing wireless communication systems. DRL learns from interacting with the environment without needing a labeled dataset, enabling adapting to the dynamic changes in the communication environment. In this work, we develop DRL frameworks to optimize full-duplex (FD) RIS-assisted communication systems. FD communications are envisioned as one of the essential technologies for future wireless communications. Incorporating RIS into FD systems can efficiently establish a reliable communication system and resolve the co-channel interference issue of FD systems. To this end, this work first proposes a low-complexity DRL algorithm to optimize the RIS phase shifts of a half-duplex (HD)-FD RIS-assisted communication system. The proposed algorithm is the first of its kind, which tackles the optimization problem in the FD operating mode. It was shown that the proposed algorithm significantly improves the rate compared to the non-optimized case in both operating modes and reduces the computational complexity compared to the state-of-the-art algorithm in the HD operating mode. Furthermore, the deployment of distributed RISs is also investigated in this thesis. In particular, the preference of deploying single or distributed RIS schemes is studied based on the links’ quality considering three practical scenarios. The sum-rate maximization problem is considered subject to transmit beamformers and RIS phase shifts of a FD RIS-assisted communication system. To address the optimization problem, a two-step solution is proposed. First, a closed-form solution is derived to optimize the beamformers. Second, a DRL algorithm is proposed to optimize the RIS phase shifts. The proposed solution was shown to efficiently outperform the conventional beamformers approximation and improve the sum rate compared to the non-optimized RIS phase shifts. Finally, this work considers a DRL approach for optimizing the discrete phase shifts of FD distributed RIS-assisted system. The discrete phase shifts are considered to offer a feasible solution, since the continuous phase shifts are infeasible to implement due to hardware limitations. A deep Q-learning algorithm is developed to optimize the RIS phase shifts, along with two mathematical beamformers derivations (i.e., closed-form and approximate). The performance of the proposed algorithm is further assessed through extensive simulations by considering two scenarios: the presence of the line-of-sight (LoS) link and when it is blocked. It was shown that the proposed algorithm achieves promising results compared to the ideal approach (the continuous baseline), which guarantees a near-optimal performance. The complexity analysis for all proposed algorithms and simulation results are provided to support these findings.

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 enseignants

Ni 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.

score de la tête « metaresearch » (Codex)0,001
score de la tête « metaresearch » (Gemma)0,000
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesMéta-épidémiologie (sens strict), Études des sciences et des technologies
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Simulation ou modélisation · Signal consensuel: aucune
GenreSignal candidat: Empirique · Signal consensuel: Empirique
Score de désaccord entre enseignants0,568
Score d'incertitude au seuil1,000

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0010,000
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0000,000
Bibliométrie0,0020,007
Études des sciences et des technologies0,0010,001
Communication savante0,0000,001
Science ouverte0,0020,001
Intégrité de la recherche0,0010,001
Charge utile insuffisante (le modèle a refusé de juger)0,0000,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.

Tête enseignante Opus0,031
Tête enseignante GPT0,281
Écart entre enseignants0,250 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_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écoule

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.

Devis d'étudeSimulation ou modélisation
Domainenon disponible
GenreEmpirique

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 ».

En bref

Citations0
Publié2023
Routes d'admission1
Résumé présentoui

Explorer davantage

Même revueMemorial University Research Repository (Memorial University)Même sujetAdvanced Wireless Communication TechnologiesTravaux en français237 207