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

IDDR: Improved Density Controlled Divide-and-Rule Scheme for Energy Efficient Routing in Wireless Sensor Networks

2014· article· en· W2072190413 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 · 2014
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of AlbertaDalhousie University
Fundersnot available
KeywordsComputer scienceEnergy consumptionWireless sensor networkEnergy (signal processing)Computer networkRouting protocolScheme (mathematics)Protocol (science)Routing (electronic design automation)ResidualSelection (genetic algorithm)Distributed computingAlgorithmElectrical engineeringArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

In Wireless Sensor Networks (WSNs) unbalanced energy consumption is a major problem. As a result, energy hole is created and network lifetime is reduced. In this paper, we propose IDDR to avoid the energy hole creation through uniform energy consumption. Proposed scheme reduces coverage and energy hole by dividing the network into small segments with static number of Cluster Heads (CHs) in each round. Selection of CH in each segment is based on maximum residual energy. Simulation results prove that proposed protocol outperforms the compared protocols.

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.003
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: Empirical · Consensus signal: none
Teacher disagreement score0.599
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.002
Science and technology studies0.0010.000
Scholarly communication0.0010.001
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.006
GPT teacher head0.206
Teacher spread0.200 · 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