MétaCan
Menu
Back to cohort
Record W2134682645 · doi:10.1109/icc.2011.5962514

Fast and Slow Hopping MAC Protocol for Single-Hop Ad Hoc Wireless Networks

2011· article· en· W2134682645 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 institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer networkComputer scienceRendezvousWireless ad hoc networkThroughputProtocol (science)Hop (telecommunications)Wireless networkMultiple Access with Collision Avoidance for WirelessChannel (broadcasting)Distributed coordination functionTransmission (telecommunications)WirelessDistributed computingOptimized Link State Routing ProtocolIEEE 802.11Routing protocolNetwork packetTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

This paper proposes a novel multi-channel medium access control (MAC) protocol using fast and slow hopping sequences with dual radio interfaces. Specifically, one interface follows fast hopping and is primary for transmission, and the second interface follows slow hopping and is mainly responsible for reception. In addition, the new protocol follows the IEEE 802.11 MAC strategy. Moreover, the new protocol is based on the multiple rendezvous approach that has been proven to enhance the network performance and resolve the congestion of the single rendezvous approach. Also, an analytical model is developed to evaluate the network performance in terms of the aggregate throughput. Computer simulations using network simulator-2 (ns-2) are conducted to validate the analytical model and demonstrate the enhancement of the proposed protocol.

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: Protocol · Consensus signal: none
Teacher disagreement score0.963
Threshold uncertainty score0.817

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.064
GPT teacher head0.279
Teacher spread0.214 · 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

Citations10
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207