Secure Transmission in Cell-Free Massive MIMO Under Active Eavesdropping
Bibliographic record
Abstract
We study secure communications in cell-free massive multiple-input multiple-output (CF-mMIMO) systems with multi-antenna access points (APs) and protective partial zero-forcing (PPZF) precoding. In particular, we consider an active eavesdropping attack, where an eavesdropper contaminates the uplink channel estimation phase by sending an identical pilot sequence with a legitimate user of interest. We formulate an optimization problem for maximizing the received signal-to-noise ratio (SINR) at the legitimate user, subject to a maximum allowable SINR at the eavesdropper and maximum transmit power at each AP, while guaranteeing specific SINR requirements on other legitimate users. The optimization problem is solved using a path-following algorithm. We also propose a large-scale-based greedy AP selection scheme to improve the secrecy spectral efficiency (SSE). Finally, we propose a simple method for identifying the presence of an eavesdropper within the system. Our findings show that PPZF can substantially outperform the conventional maximum-ratio transmission (MRT) scheme by providing around 2-fold improvement in the SSE compared to the MRT scheme. More importantly, for PPZF precoding scheme, our proposed AP selection can achieve a remarkable SSE gain of up to 220%, while our power optimization approach can provide an additional gain of up to 55% compared with a CF-mMIMO system with equal power allocation.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".