MétaCan
Menu
Back to cohort
Record W2068667489 · doi:10.1109/wcnc.2014.6952203

Delay constrained buffer-aided relaying with outdated CSI

2014· article· en· W2068667489 on OpenAlexaff
Toufiqul Islam, Diomidis S. Michalopoulos, Robert Schober, Vijay K. Bhargava

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsChannel state informationComputer scienceRelayTransmission (telecommunications)Network packetChannel (broadcasting)Selection (genetic algorithm)Node (physics)ScheduleTransmission delayBit error rateComputer networkDiversity gainControl theory (sociology)Real-time computingFadingTelecommunicationsWirelessEngineeringPower (physics)Control (management)

Abstract

fetched live from OpenAlex

Recent studies have shown that buffer-aided relaying with adaptive link selection can provide significant performance gains compared to conventional relaying using a fixed transmission schedule. In this paper, we focus on error rate analysis of adaptive link selection for a three node decode-and-forward (DF) relay network with fixed-rate transmission. As in practice link selection may be performed based on outdated channel state information (CSI) because of a delay in the feedback link, we study the error rate performance for both perfect and outdated CSI. Since a packet transmission delay is unavoidable with opportunistic link selection, we provide a unified error-rate analysis in terms of a decision threshold β which can be adjusted to achieve buffer stability and a desired average system delay. We show that a diversity gain of two can be achieved for perfect CSI and the optimum BER can be approached even if only a small delay is tolerated.

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 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.000
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.935
Threshold uncertainty score0.336

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.000
Open science0.0010.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.025
GPT teacher head0.248
Teacher spread0.223 · 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 teacher head, 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

Citations11
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207