MétaCan
Menu
Back to cohort
Record W1767535989 · doi:10.1109/.2006.1629392

SeMAC: Robust Broadcast MAC Protocol for Multi-hop Wireless Ad Hoc Networks

2006· article· en· W1767535989 on OpenAlexaff
Hossam S. Hassanein

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer networkComputer scienceUnicastWireless ad hoc networkAtomic broadcastVehicular ad hoc networkOptimized Link State Routing ProtocolAd hoc wireless distribution serviceBroadcast radiationBroadcast communication networkDistributed computingMobile ad hoc networkBroadcasting (networking)WirelessRouting protocolRouting (electronic design automation)MulticastTelecommunications

Abstract

fetched live from OpenAlex

In an ad hoc network, broadcast data communication is an unavoidable type of data transmission that provides synchronization, routing, and other messages to all the neighboring devices. Guaranteeing that all neighboring MTs receive broadcast messages is a hard task in multi-hop wireless ad hoc networks, especially when the traffic load is heavy. In this paper, we propose the sequential medium access control (SeMAC) protocol which aims at collision-free communication and reduced overhead for predictable broadcast message to sustain dynamic changes in network topology, as well as facilitate smooth operation of peer-to-peer unicast in multi-hop ad hoc networks SeMAC is intended to complement the IEEE 802.11 DCF function and is shown in this paper to greatly enhance the performance of broadcast and unicast communication of the IEEE 802.11.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Protocol · Consensus signal: none
Teacher disagreement score0.681
Threshold uncertainty score1.000

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.001
Science and technology studies0.0000.000
Scholarly communication0.0010.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.050
GPT teacher head0.309
Teacher spread0.260 · 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.

Study designSimulation or modeling
Domainnot available
GenreProtocol

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
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207