MétaCan
Menu
Back to cohort
Record W1515185950 · doi:10.1109/lcn.2004.16

An adaptive distributed ID assignment scheme for CSMA/IC

2005· article· en· W1515185950 on OpenAlexaff
Tiantong You, Chi‐Hsiang Yeh, Hossam S. Hassanein

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsQueen's University
Fundersnot available
KeywordsMultiple Access with Collision Avoidance for WirelessCarrier sense multiple access with collision avoidanceComputer scienceComputer networkHidden node problemThroughputWireless ad hoc networkCountdownDistributed coordination functionTransmission (telecommunications)WirelessScheme (mathematics)Protocol (science)Wireless networkCollisionDistributed computingVehicular ad hoc networkIEEE 802.11Wi-Fi arrayEngineeringComputer securityTelecommunications

Abstract

fetched live from OpenAlex

We investigate a new collision-free MAC protocol for ad hoc wireless networks, namely carrier sense media access/ID countdown (CSMA/IC), which can achieve 100% collision-free performance by solving both the "hidden terminal" and the concurrent sending problems. Furthermore, we propose an efficient ID assignment mechanism for CSMA/IC. With the new ID assignment mechanism, the length of the medium competition period before data transmission is greatly decreased. This further leads to an increase in network throughput, especially in high speed wireless networks.

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.925
Threshold uncertainty score0.488

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.001
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.019
GPT teacher head0.260
Teacher spread0.241 · 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

Citations4
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207