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

Fault Tolerant Wireless Sensor Networks using Adaptive Partitioning

2012· article· en· W2079099236 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

VenueProcedia Computer Science · 2012
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsRetransmissionComputer scienceCorrectnessWireless sensor networkFault toleranceWirelessDistributed computingComputer networkWireless networkError detection and correctionReal-time computingAlgorithmTelecommunications

Abstract

fetched live from OpenAlex

Wireless Sensor Networks (WSNs) communicate over error-prone wireless links that make reliable data transmis–sion a challenging task. Retransmission functions are typically employed as a mechanism to provide data integrity and correctness, however, it has been proven that such mechanism is extremely inefficient, especially in environments characterized with high error rates. This paper proposes an adaptive partitioning technique that adds error correction at the Link Layer to minimize retransmission. This method involves partitioning frames such that errors can be isolated and corrected. The paper compares the proposed method with current retransmission protocols and justifies how the proposed model outperforms in certain scenarios.

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)
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.501
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.001
Scholarly communication0.0010.003
Open science0.0020.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.024
GPT teacher head0.244
Teacher spread0.220 · 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