MétaCan
Menu
Back to cohort
Record W1994899504 · doi:10.1016/j.procs.2013.06.044

AdAMAC: A New MAC Protocol for High Traffic Wireless Networks

2013· article· en· W1994899504 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueProcedia Computer Science · 2013
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsYork University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceComputer networkMultiple Access with Collision Avoidance for WirelessAccess controlWireless ad hoc networkNetwork packetThroughputLatency (audio)Wireless sensor networkWireless networkWirelessWireless distribution systemMedia access controlWi-Fi arrayOptimized Link State Routing ProtocolTelecommunicationsRouting protocol

Abstract

fetched live from OpenAlex

Medium access control is a key problem in wireless ad hoc and sensor networks. An efficient medium access control algorithm allows nodes to share the wireless medium at a lower energy cost and achieve a higher throughput. Most existing medium access control techniques for wireless networks are designed to work well under low traffic rates. In this paper we propose a new medium access control algorithm AdAMAC for wireless ad hoc and sensor networks under relatively high traffic rates. We demonstrate using simulations that AdAMAC outperforms the best medium access control algorithms designed for higher traffic rates in terms of packet delivery ratio and latency and has a similar energy cost to them.

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), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.581
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.0000.000
Bibliometrics0.0000.003
Science and technology studies0.0010.000
Scholarly communication0.0020.002
Open science0.0050.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.014
GPT teacher head0.246
Teacher spread0.233 · 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