Resource Allocation for Max-Min Fairness in Multi-Cell Massive MIMO
Notice bibliographique
Résumé
Massive MIMO (multiple-input multiple-output) is considered as an heir of the multi-user MIMO technology and it has recently gained lots of attention from both academia and industry.By equipping base stations (BSs) with hundreds of antennas, this new technology can provide very large multiplexing gains by serving many users on the same time-frequency resources and thereby bring significant improvements in spectral efficiency (SE) and energy efficiency (EE) over the current wireless networks.The transmit power, pilot training, and spatial transmission resources need to be allocated properly to the users to achieve the highest possible performance.This is called resource allocation and can be formulated as design utility optimization problems.If the resource allocation in Massive MIMO is optimized, the technology can handle the exponential growth in both wireless data traffic and number of wireless devices, which cannot be done by the current cellular network technology.In this thesis, we focus on two resource allocation aspects in Massive MIMO: The first part of the thesis studies if power control and advanced coordinated multipoint (CoMP) techniques are able to bring substantial gains to multi-cell Massive MIMO systems compared to the systems without using CoMP.More specifically, we consider a network topology with no cell boundary where the BSs can collaborate to serve the users in the considered coverage area.We focus on a downlink (DL) scenario in which each BS transmits different data signals to each user.This scenario does not require phase synchronization between BSs and therefore has the same backhaul requirements as conventional Massive MIMO systems, where each user is preassigned to only one BS.The scenario where all BSs are phase synchronized to send the same data is also included for comparison.We solve a total transmit power minimization problem in order to observe how much power Massive MIMO BSs consume to provide the requested quality of service (QoS) of each user.A max-min fairness optimization is also solved to provide every user with the same maximum QoS regardless of the propagation conditions.The second part of the thesis considers a joint pilot design and uplink (UL) iii power control problem in multi-cell Massive MIMO.The main motivation for this work is that the pilot assignment and pilot power allocation is momentous in Massive MIMO since the BSs are supposed to construct linear detection and precoding vectors from the channel estimates.Pilot contamination between pilot-sharing users leads to more interference during data transmission.The pilot design is more difficult if the pilot signals are reused frequently in space, as in Massive MIMO, which leads to greater pilot contamination effects.Related works have only studied either the pilot assignment or the pilot power control, but not the joint optimization.Furthermore, the pilot assignment is usually formulated as a combinatorial problem leading to prohibitive computational complexity.Therefore, in the second part of this thesis, a new pilot design is proposed to overcome such challenges by treating the pilot signals as continuous optimization variables.We use those pilot signals to solve different max-min fairness optimization problems with either ideal hardware or hardware impairments.I would like to send my gratitude to the main supervisor, Associate Professor Emil Björnson, for his valuable supervision and support.His advice, instruction, inspiration, and encouragement have been indispensable for my academic years.He is always dedicated to provide useful guidance whenever I need help.I would also like to
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,004 | 0,009 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,002 | 0,001 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,001 | 0,002 |
| Communication savante | 0,002 | 0,002 |
| Science ouverte | 0,002 | 0,002 |
| Intégrité de la recherche | 0,001 | 0,002 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,004 | 0,001 |
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 ».