MétaCan
Menu
Back to cohort
Record W1981303518 · doi:10.1145/2379776.2379783

A survey and projection on medium access control protocols for wireless sensor networks

2012· review· en· W1981303518 on OpenAlexaff
Yi Zhao, Chunyan Miao, Maode Ma, Jing Bing Zhang, Cyril Leung

Bibliographic record

VenueACM Computing Surveys · 2012
Typereview
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceWireless sensor networkComputer networkAccess controlPreambleProtocol (science)WirelessKey distribution in wireless sensor networksMultiple Access with Collision Avoidance for WirelessKey (lock)Wireless networkDistributed computingTelecommunicationsComputer securityChannel (broadcasting)

Abstract

fetched live from OpenAlex

Recent advances in wireless communications and sensor technologies have enabled the development of low-cost wireless sensor networks (WSNs) for a wide range of applications. Medium access control (MAC) protocols play a crucial role in WSNs by enabling the sharing of scarce wireless bandwidth efficiently and fairly. This article provides a survey of the literature on MAC protocols for WSNs. We first briefly describe the unique features of WSNs. We then review representative MAC protocols from the following four categories: contention-based protocols, contention-free (scheduled-based) protocols, hybrid protocols , and preamble sampling protocols. Our discussions focus on the background, main features, operation procedures, major design issues, and the advantages and disadvantages of these protocols. We also present an analysis of the inherent and desirable features of the protocols, and the key challenges of MAC technology for WSNs. Finally, we present our view on future research directions for WSN MAC protocols in a reader-friendly way using illustrative diagrams.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Review · Consensus signal: Review
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.009
Science and technology studies0.0010.001
Scholarly communication0.0020.005
Open science0.0020.001
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0050.004

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.128
GPT teacher head0.379
Teacher spread0.251 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreReview

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

Citations60
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueACM Computing SurveysSame topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207