Studies in cell-free massive-MIMO: Green power allocation, physical security, and DoA estimation
Bibliographic record
Abstract
Cell-free massive MIMO (m-MIMO) has been designated as a key enabling technology for beyond the fifth generation (B5G) and the sixth generation (6G) of wireless communication networks.It is essentially a distributed heterogeneous network in which a large number of access points (APs), scattered over a geographical area and coordinated by a central processing unit (CPU), serve multiple users without being bounded by cells.Cell-free m-MIMO, as a state-of-the-art technology, offers several advantages, including: high spectral efficiency (SE), large-scale diversity gain, and avoiding the need for frequent handovers.Nevertheless, the practical deployment of cell-free m-MIMO poses several signal processing challenges at the physical layer.For instance, the total power consumption for the communication links can reach such a high level as to defeat the SE gains.As a distributed network, cell-free m-MIMO suffers potentially from physical security issues, especially the pilot spoofing attack, which is launched by an eavesdropper (Eve) to overhear an intended user.Finally, the quality of certain channel parameters, required for signal processing tasks at the CPU can be severely affected due to the use of low-resolution quantizers on the backhaul links between the APs and the CPU.In this thesis, we respectively address and propose novel solutions to the above issues in three parts.Specifically, we commence with the problem of downlink power allocation in a cell-free m-MIMO system under SE constraints for the users.The power allocation is formulated as an optimization problem where the aim is to maximize the sum SE as the objective function, while limiting the transmission power of APs and imposing lower and upper bounds on the achievable SEs of different users.While the problem is non-convex, an efficient solution approach is developed through the use of bounding and relaxation techniques.Interestingly, it reveals that each user is allocated a fraction of available power proportional to its required data rate, which in turn, leads to a significant reduction in total power consumption.Besides, the quality of service can be enhanced for users who require high SE but are located at the periphery of the network coverage area.In the second part of the thesis, we propose two novel methods based on the loglikelihood ratio test (LLRT), one in a centralized and the other in a decentralized fashion, to cope with the problem of pilot spoofing attack in a cell-free m-MIMO system.The methods take advantage of a special protocol in which the legitimate users switch to an off-mode irregularly, without significantly affecting the spectral efficiency of the data transmission.Dans la deuxième partie de la thèse, nous proposons deux nouvelles méthodes basées sur le test du rapport de vraisemblance (LLRT), l'une de manière centralisée et l'autre de manière décentralisée, pour faire face au problème d'attaque par usurpation de pilote dans une cellule.système m-MIMO gratuit.Les procédés tirent parti d'un protocole spécial dans lequel les utilisateurs légitimes passent irrégulièrement en mode hors tension, sans affecter de manière significative l'efficacité spectrale de la transmission de données.Le protocole est applicable aux environnements à mobilité faible à modérée, mais peut être étendu à une mobilité élevée grâce à un simple réarrangement des séquences pilotes disponibles parmi les utilisateurs.Les performances de détection des méthodes proposées sont analysées mathématiquement et leur validité est confirmée par des simulations.De plus, les méthodes proposées surpassent de manière significative les approches de référence de la littérature récente en termes de probabilités de détection et de fausses alarmes, tout en nécessitant une faible surcharge frontale.Dans la dernière partie de la thèse, nous considérons le problème d'estimation de la direction d'arrivée (DoA) dans le m-MIMO sans cellule et proposent une nouvelle méthode basée sur la technologie de pointe des réseaux de neurones profonds (DNN).Pour former le DNN, une fonctionnalité spéciale est proposé tel qu'obtenu à partir des premières entrées superdiagonales de la matrice de corrélation spatiale.Cette sélection de fonctionnalités permet d'utiliser un DNN avec seulement quelques couches de faible dimension, ce qui accélère considérablement jusqu'à la formation et le traitement.La méthode proposée offre une résolution élevée et une réduction significative en termes de temps de traitement par rapport aux approches établies dans la littérature.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".