MétaCan
Menu
Back to cohort

Secrecy Outage Probability of SWIPT-OFDMA Schemes with Transmit Antenna Selection

2023· article· en· W4386212465 on OpenAlexaff
Ahmet Faruk Coşkun, Oğuz Kucur, Güneş Karabulut Kurt

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsComputer scienceOrthogonal frequency-division multiple accessWirelessSecrecyMaximum power transfer theoremComputer networkFrequency-division multiple accessTelecommunicationsPower (physics)Orthogonal frequency-division multiplexingComputer securityChannel (broadcasting)

Abstract

fetched live from OpenAlex

This study examines the wireless communications secrecy performance of multi-user (MU) simultaneous wireless information and power transfer (SWIPT) scheme employing transmit antenna selection (TAS) and maximal-ratio combining (MRC). In order to address the user scheduling requirement of MU-SWIPT scheme, orthogonal frequency-division multiple access (OFDMA) has been utilized, and the secrecy outage probability (SOP) performance is examined via simulations. In the study, it is aimed to examine a realistic scenario where eavesdropper might detect the sub-carrier indices of the legitimate users. In addition, the variation of the SOP performance has been revealed for different values of the number of legitimate users, the number of eavesdropper antennas, the power division factor related to the SWIPT process and the noise variance introduced by the information decoder.

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.004
metaresearch head score (Gemma)0.013
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: Methods · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.013
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.002
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.018
GPT teacher head0.228
Teacher spread0.210 · 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
GenreMethods

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
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Security TechniquesFrench-language works237,207