MétaCan
Menu
Back to cohort
Record W2081686652 · doi:10.4236/wsn.2011.38029

Modeling of Data Reduction in Wireless Sensor Networks

2011· article· en· W2081686652 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

VenueWireless Sensor Network · 2011
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceWireless sensor networkAsynchronous communicationWireless networkReduction (mathematics)Real-time computingField (mathematics)Distributed computingWirelessData miningComputer networkTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we present a stochastic model for data in a Wireless Sensor Network (WSN) using random field theory. The model captures the space-time behavior of the underlying phenomenon being observed by the network. We present results regarding the size and spatial distribution of the regions of the network that sense statistically extreme values of the underlying phenomenon using the theory of extreme excursion regions. These results compliment many existing works in the literature that describe algorithms to reduce the data load, but lack an analytical approach to evaluate the size and spatial distribution of this load. We show that if only the statistically extreme data is transmitted in the network, then the data load can be significantly reduced. Finally, a simple performance model of a WSN is developed based on a collection of asynchronous M/M/1 servers that work in parallel. We derive several performance measures from this performance model. The presented results will be useful in the design of large scale sensor networks.

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.574
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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.059
GPT teacher head0.273
Teacher spread0.214 · 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