MétaCan
Menu
Back to cohort
Record W2047300650 · doi:10.1002/ett.1137

Performance of collaborative codes in CSMA/CD environment

2006· article· en· W2047300650 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

VenueEuropean Transactions on Telecommunications · 2006
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsCarrier sense multiple access with collision avoidanceComputer scienceThroughputNetwork packetMarkov chainComputer networkChannel (broadcasting)Distributed coordination functionAccess controlChannel access methodProtocol (science)CollisionScheme (mathematics)WirelessComputer securityMathematicsIEEE 802.11Telecommunications

Abstract

fetched live from OpenAlex

Abstract A new medium access control scheme is proposed for implementing collaborative codes in a system using carrier sense multiple access with collision detection protocol (CC‐CSMA/CD). We also propose a new backoff algorithm which is simple to implement and to analyse. A discrete‐time Markov chain analytical model is developed for CC‐CSMA/CD. The resulting model describes the regular CSMA/CD as a special case. Protocol performance measures were studied such as throughput, packet acceptance probability, average packet delay and channel utilisation. It is found that CC‐CSMA/CD offers improvements over a system that uses CSMA/CD in terms of throughput, packet acceptance probability, delay and channel utilisation. Copyright © 2006 AEIT.

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.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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.688
Threshold uncertainty score0.585

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.001
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.008
GPT teacher head0.196
Teacher spread0.188 · 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