MétaCan
Menu
Back to cohort

A Distributed Method for Compressive Data Gathering in Wireless Sensor Networks

2014· article· en· W2142907745 on OpenAlex
Dariush Ebrahimi, Chadi Assi

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

VenueIEEE Communications Letters · 2014
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsConcordia University
Fundersnot available
KeywordsWireless sensor networkComputer scienceComputer networkData aggregatorKey distribution in wireless sensor networksCompressed sensingData collectionMobile wireless sensor networkDistributed computingOverhead (engineering)Sink (geography)Routing (electronic design automation)Efficient energy useNode (physics)WirelessWireless networkTelecommunicationsAlgorithmEngineering

Abstract

fetched live from OpenAlex

Compressive data gathering (CDG) has recently emerged to provide energy efficient data aggregation in wireless sensor networks. CDG requires efficient routing (forwarding) trees to gather encoded data from sensor nodes to the sink. This paper presents a decentralized method for the compressive data gathering problem (DCDG). Our method allows each sensor node to locally make a decision in constructing and maintaining the forwarding trees and has minimal complexity and overhead with outstanding performance.

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 categoriesOpen science
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.516
Threshold uncertainty score0.998

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0070.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.047
GPT teacher head0.309
Teacher spread0.262 · 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