MétaCan
Menu
Back to cohort
Record W2126417905 · doi:10.1109/ccece.2008.4564590

Throughput enhancement in cooperative diversity wireless networks using adaptive modulation

2008· article· en· W2126417905 on OpenAlexaffvenue
Hao Chen, Mohamed H. Ahmed

Bibliographic record

VenueConference proceedings - Canadian Conference on Electrical and Computer Engineering · 2008
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsThroughputDiversity gainComputer scienceCooperative diversityRayleigh fadingLink adaptationFadingSignal-to-noise ratio (imaging)Modulation (music)Diversity combiningDiversity schemeComputer networkAntenna diversityTransmission (telecommunications)Electronic engineeringWirelessTelecommunicationsChannel (broadcasting)EngineeringPhysics

Abstract

fetched live from OpenAlex

This paper analyzes the throughput performance of cooperative diversity wireless networks using adaptive modulation over Rayleigh fading channels. Cooperative diversity is achieved by utilizing neighbouring terminals as relays. These relays can generate copies of the same signal, which can provide spatial diversity gain and signal-to-noise ratio (SNR). The main drawback of cooperative diversity is the throughput loss due to the extra resources needed for relaying. Therefore, throughput is greatly reduced. In this paper, the adaptive modulation is used to convert the obtained SNR gain to throughput gain to compensate for the throughput loss. Results show that the use of adaptive modulation in cooperative diversity networks not only compensates for the throughput loss but also achieves considerable throughput gain compared with the classical system with direct transmission only.

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: Empirical · Consensus signal: Empirical
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.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.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.051
GPT teacher head0.224
Teacher spread0.173 · 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

Citations12
Published2008
Admission routes2
Has abstractyes

Explore more

Same venueConference proceedings - Canadian Conference on Electrical and Computer EngineeringSame topicCooperative Communication and Network CodingFrench-language works237,207