MétaCan
Menu
Back to cohort
Record W2140124754 · doi:10.1109/glocom.2005.1578320

Performance analysis of the node cooperative ARQ scheme for wireless ad-hoc networks

2005· article· en· W2140124754 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueGLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsWireless ad hoc networkComputer scienceComputer networkNode (physics)Scheme (mathematics)Selective Repeat ARQAutomatic repeat requestAd hoc wireless distribution serviceMobile ad hoc networkWireless networkWirelessOptimized Link State Routing ProtocolHybrid automatic repeat requestTelecommunicationsTelecommunications linkNetwork packetEngineeringMathematics

Abstract

fetched live from OpenAlex

In wireless channels, the bursty nature of block errors render immediate packet retransmissions at the link level ineffective. Cooperative communication is a promising technique to combat the negative impacts of channel fading by providing diverse channels between peers in wireless ad-hoc networks. In this paper, an analytical model is proposed for the throughput of the node cooperative automatic repeat request scheme for wireless ad-hoc networks. The model is based on a two-state Markov model for block errors in the wireless fading channels. Simulation results are given to demonstrate effectiveness of the analytical model

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.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Open science
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.774
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.004
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0070.001
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.038
GPT teacher head0.292
Teacher spread0.254 · 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