MétaCan
Menu
Back to cohort
Record W2098360731 · doi:10.1109/isit.2006.262002

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

2006· article· en· W2098360731 on OpenAlexaff
Yiyi Zhao, Raviraj Adve, Teng Joon Lim

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsYork UniversityUniversity of Toronto
Fundersnot available
KeywordsRelayComputer scienceNode (physics)ThroughputSelection (genetic algorithm)Transmission (telecommunications)Computer networkPower (physics)Scheme (mathematics)Relay channelCooperative diversityOutage probabilityChannel (broadcasting)Mathematical optimizationWirelessTelecommunicationsFadingEngineeringMathematics

Abstract

fetched live from OpenAlex

We consider an amplify-and-forward (AF) cooperative diversity system where a source communicates with a destination with the help of multiple relay nodes. The conventional system 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 an optimal power allocation scheme to minimize the outage probability for an AF system. Next, we propose a new selection scheme where only one, the "best" relay node is chosen to participate in the transmission. We show that at reasonable power levels the selection AF scheme maintains full diversity order, and has significantly better outage behavior and average throughput than the conventional scheme or that with optimal 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 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.004
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: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.000
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.016
GPT teacher head0.249
Teacher spread0.233 · 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

Citations603
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207