MétaCan
Menu
Back to cohort
Record W1741095448 · doi:10.1109/icc.2003.1204542

A new class of collision prevention MAC protocols for wireless ad hoc networks

2004· article· en· W1741095448 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer networkComputer scienceMultiple Access with Collision Avoidance for WirelessWireless ad hoc networkQuality of serviceNetwork packetThroughputCollisionReservationMobile ad hoc networkAd hoc wireless distribution serviceProtocol (science)Hidden node problemAccess controlMedia access controlWireless networkWirelessOptimized Link State Routing ProtocolRouting protocolComputer securityWi-Fi arrayTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we investigate a new class of collision-prevention MAC protocols, called carrier sense multiple access with collision prevention (CSMA/CP), for wireless ad hoc networks. We proposed a collision-free MAC protocol called BROADEN based on CSMA/CP. To the best of our knowledge, BROADEN is the first distributed MAC protocol that can achieve 100% collision-free transmissions in both the control channel and data channel in multihop ad hoc networks. Furthermore, BROADEN can solve the hidden, exposed, and moving terminal problems at the same time. It also improves the performance of previous MAC protocols in terms of average packet delay and network throughput. Moreover, our protocol effectively supports quality-of-service (QoS) provisioning based on prioritization and reservation.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.723
Threshold uncertainty score0.598

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.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.027
GPT teacher head0.312
Teacher spread0.284 · 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

Quick stats

Citations51
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207