Energy-aware resource allocation in next generation wireless networks : application in large-scale MIMO Systems
Notice bibliographique
Résumé
In this thesis, we investigate the resource allocation problem for wireless networks that incorporate large-scale multiple-input multiple-output (MIMO) systems. These systems are considered as key technologies for future 5G wireless networks and are based on using few hundreds of antennas simultaneously to serve tens of users in the same time-frequency resource. The gains obtained by large-scale MIMO systems cannot be fully exploited without adequate resource allocation strategies. Hence, the aim of this thesis is to develop energy-aware resource allocation solutions for large-scale MIMO systems that take into consideration network power cost. \n \nFirstly, this thesis investigates the downlink of a base station equipped with large-scale MIMO system while taking into account a non-negligible transmit circuit power consumption. This consumption involves that activating all RF chains does not always necessarily achieve the maximum sum-rate. Thus, we derive the optimal number of activated RF chains. In addition, efficient antenna selection, user scheduling and power allocation algorithms in term of instantaneous sum-rate are proposed and compared. Also, fairness is investigated by considering equal receive power among users. \n \nSecondly, this thesis investigates a large-scale MIMO system that incorporates energy harvesting that is a promising key technology for greening future wireless networks since it reduces network operation costs and carbon footprints. Hence, we consider distributed large-scale MIMO systems made up of a set of remote radio heads (RRHs), each of which is powered by both an independent energy harvesting source and the grid. The grid energy source allows to compensate for the randomness and intermittency of the harvested energy. Optimal on-line and off-line energy management strategies are developed. In addition, on-line energy management algorithm based on energy prediction is devised. The feasibility problem is addressed by proposing an efficient link removal algorithm and for better energy efficiency, RRH on/off operation is investigated. \n \nThirdly, wireless backhauling was proposed as an alternative solution that enable low-cost connection between the small base stations and the macro base station in heterogeneous networks (HetNets). The coexistence of massive MIMO, HetNets and wireless backhauling is a promising research direction since massive MIMO is a suitable solution to enable wireless backhauling. Thus, we propose a new transmission technique that is able to efficiently manage the interference in heterogeneous networks with massive MIMO wireless backhaul. The optimal time splitting parameter and the allocated transmit power are derived. The proposed transmission technique is shown to be more efficient in terms of transmit power consumption than the conventional reverse time division duplex with bandwidth splitting. \n \nIn this thesis, we developed efficient resource allocation solutions related to system power for wireless networks that incorporate large-scale MIMO systems under different assumptions and network architectures. The results in this thesis can be expanded by investigating the research problems given at the end of the dissertation.
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 machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,001 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,000 |
| Méta-épidémiologie (sens large) | 0,001 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,001 |
| Communication savante | 0,001 | 0,001 |
| Science ouverte | 0,000 | 0,001 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,002 | 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 source (Gemma direct ou Codex distillé), 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 ».