MétaCan
Menu
Back to cohort
Record W3144673228

1Improving Amplify-and-Forward Relay Networks: Optimal Power Allocation versus Selection

2015· article· en· W3144673228 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsRelayComputer scienceNode (physics)Channel state informationThroughputSelection (genetic algorithm)Transmission (telecommunications)Cooperative diversityRelay channelChannel (broadcasting)Computer networkPower (physics)Mathematical optimizationDiversity gainWirelessTelecommunicationsFadingMathematicsEngineering
DOInot available

Abstract

fetched live from OpenAlex

We consider an Amplify-and-Forward cooperative diversity system where a source node communicates with a destination node with the help of one or more relay nodes. The conventional system model assumes all relay nodes participate, with the available channel and power resources equally distributed over all nodes. This approach being clearly sub-optimal, we first present two power allocation schemes to minimize the system outage probability, based on complete channel state information and channel statistics, respectively. We further show that the proposed optimal power allocation methods minimize system symbol error rate as well. Next, we propose a selection scheme where only one “best ” relay node is chosen to assist in the transmission. We show that the selection-AF scheme maintains full diversity order, and at reasonable power levels has significantly better outage behavior and average throughput than the conventional all-participate scheme or that with optimal power allocation. Finally we combine power allocation and selection to further improve performance.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.938
Threshold uncertainty score0.402

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.047
GPT teacher head0.285
Teacher spread0.238 · 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