MétaCan
Menu
Back to cohort
Record W2108553934 · doi:10.1109/ccece.2009.5090141

Capacity analysis of a decode-and-forward cooperative network under adaptive transmission

2009· article· en· W2108553934 on OpenAlexaff
Prasanna Kalansuriya, Chintha Tellambura

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsFadingComputer scienceMonte Carlo methodNakagami distributionOutage probabilityTransmission (telecommunications)Constant (computer programming)Power (physics)Closed-form expressionTopology (electrical circuits)WirelessWireless networkChannel (broadcasting)MathematicsTelecommunicationsStatisticsPhysicsCombinatorics

Abstract

fetched live from OpenAlex

This paper presents a capacity analysis of a decode-and-forward (DF) cooperative network with adaptive source transmission. Three different adaptive techniques are considered: (i) optimal simultaneous power and rate adaptation (OPRA); (ii) constant power with optimal rate adaptation (ORA); (iii) truncated channel inversion with fixed rate (TIFR). Closed form capacity expressions are derived for non-identical and independently distributed (non-i.i.d.) Nakagami-m fading wireless environments. These expressions are validated by simulation results obtained through Monte Carlo simulation. It is observed that OPRA and ORA provide roughly the same capacity, while TIFR yields slightly less capacity relative to the other two.

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.002
metaresearch head score (Gemma)0.009
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.007
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
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.0020.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.281
Teacher spread0.234 · 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

Citations9
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207