MétaCan
Menu
Back to cohort
Record W2062598172 · doi:10.1109/glocom.2014.7036820

An efficient adaptive MAC frame aggregation scheme in delay tolerant sensor networks

2014· article· en· W2062598172 on OpenAlexaff
Xiaoli Zhou, Azzedine Boukerche

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceComputer networkWireless sensor networkQuality of serviceEnergy consumptionQueueThroughputData aggregatorTransmission (telecommunications)Efficient energy useFrame (networking)Scheme (mathematics)Channel (broadcasting)Transmission delayData transmissionWirelessReal-time computingTelecommunicationsNetwork packetEngineering

Abstract

fetched live from OpenAlex

In delay-tolerant sensor networks where connectivity is not guaranteed, sensors are seeking efficient ways to send the collected data during relatively rare transmission opportunities. Aggregation is one of the major ways to improve the data throughput while consuming less energy consumption. This paper proposes an adaptive aggregation scheme for MAC 802.11 to improve the transmission efficiency in unstable wireless delay-tolerant environments. The aggregation scheme not only considers the upper layer separation of quality of service (QoS) requirements into different queues, but also adapts the wireless channel status to the aggregation procedure. The simulation results show that the scheme improves the transmission efficiency and reduces the number of transmission times by aggregating data; thus saving sensor energy consumption.

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.001
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.839
Threshold uncertainty score0.820

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.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.013
GPT teacher head0.232
Teacher spread0.219 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations10
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207