MétaCan
Menu
Back to cohort
Record W2163756625 · doi:10.1109/tvt.2007.907082

Optimizing Truncated ARQ Scheme Over Wireless Fading Channels

2008· article· en· W2163756625 on OpenAlexaff
Sangheon Pack, Xuemin Shen, J.W. Mark

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2008
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Waterloo
FundersKorea Advanced Institute of Science and TechnologyKorea Institute of Science and Technology
KeywordsRetransmissionFadingAutomatic repeat requestSelective Repeat ARQHybrid automatic repeat requestComputer scienceNetwork packetComputer networkWirelessAlgorithmTransmission (telecommunications)Channel (broadcasting)TelecommunicationsTelecommunications link

Abstract

fetched live from OpenAlex

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> In this paper, we introduce a fractional retransmission (FR) scheme to optimize the performance of a truncated automatic repeat request (ARQ) error control mechanism for transmission over wireless fading channels. For data and real-time traffic packets, we derive the explicit expressions of the average packet loss rate and find the optimal retransmission limit. Simulation results demonstrate that the FR scheme can minimize the packet loss rate. </para>

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: Empirical · Consensus signal: none
Teacher disagreement score0.792
Threshold uncertainty score0.937

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.032
GPT teacher head0.256
Teacher spread0.225 · 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
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

Citations7
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Vehicular TechnologySame topicCooperative Communication and Network CodingFrench-language works237,207