MétaCan
Menu
Back to cohort
Record W1585352813 · doi:10.1109/icc.2015.7248588

Adaptive link selection in buffer-aided relaying with statistical QoS constraints

2015· article· en· W1585352813 on OpenAlexaff
Khoa T. Phan, Tho Le‐Ngoc

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsMcGill University
Fundersnot available
KeywordsRelayFadingComputer scienceQuality of serviceComputer networkTransmission (telecommunications)Transmitter power outputNode (physics)Constraint (computer-aided design)Power (physics)TelecommunicationsEngineeringTransmitter

Abstract

fetched live from OpenAlex

This paper considers a 3-node buffer-aided relaying network with statistical delay quality-of-service (QoS) constraints imposed at the source and relay. To exploit the relay buffering capability and link fading diversity, an adaptive link selection relaying scheme is proposed. In a time slot, the relay (R) can adaptively select to receive from the source (S) or to transmit to the destination (D) based on the instantaneous conditions of the S-R and R-D links. The selection scheme aims to maximize the constant supportable arrival rate to the source, i.e., the effective capacity in consideration of the link fading distributions and the average signal-to-noise power ratios (SNRs) as well as the QoS constraints. We compare the capacities of the adaptive relaying and the fixed relaying where the relay employs fixed transmission and reception schedule, demonstrating the gain of the former, especially under loose QoS constraints. The capacities of the buffer-aided relaying and non-buffer relaying under similar end-to-end delay QoS constraint are also compared, showing the benefits of using buffer-aided relaying to support delay-sensitive applications.

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.977
Threshold uncertainty score0.284

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.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.078
GPT teacher head0.295
Teacher spread0.217 · 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

Citations5
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207