MétaCan
Menu
Back to cohort
Record W4390961202 · doi:10.48550/arxiv.2401.06859

Joint Power Optimization and AP Selection for Secure Cell-Free Massive MIMO

2024· preprint· en· W4390961202 on OpenAlexfundno aff
Yasseen Sadoon Atiya, Zahra Mobini, Hien Quoc Ngo, Michail Matthaiou

Bibliographic record

VenuearXiv (Cornell University) · 2024
Typepreprint
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsnot available
FundersQueen's UniversityQueen's University BelfastEuropean CommissionGovernment of the United Kingdom
KeywordsEavesdroppingComputer scienceJoint (building)Telecommunications linkMathematical optimizationHeuristicOptimization problemSelection (genetic algorithm)Power (physics)Power controlMIMOChannel (broadcasting)Computer networkAlgorithmMathematicsEngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, we investigate joint power control and access point (AP) selection scheme in a cell-free massive multiple-input multiple-output (CF-mMIMO) system under an active eavesdropping attack, where an eavesdropper tries to overhear the signal sent to one of the legitimate users by contaminating the uplink channel estimation. We formulate a joint optimization problem to minimize the eavesdropping spectral efficiency (SE) while guaranteeing a given SE requirement at legitimate users. The challenging formulated problem is converted into a more tractable form and an efficient low-complexity accelerated projected gradient (APG)-based approach is proposed to solve it. Our findings reveal that the proposed joint optimization approach significantly outperforms the heuristic approaches in terms of secrecy SE (SSE). For instance, the $50\%$ likely SSE performance of the proposed approach is $265\%$ higher than that of equal power allocation and random AP selection scheme.

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.032
GPT teacher head0.175
Teacher spread0.143 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicWireless Communication Security TechniquesFrench-language works237,207