MétaCan
Menu
Back to cohort
Record W2109827422 · doi:10.1155/2015/953134

Energy Hole Minimization with Field Division for Energy Efficient Routing in WSNs

2015· article· en· W2109827422 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

VenueInternational Journal of Distributed Sensor Networks · 2015
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceEnergy consumptionWireless sensor networkCluster analysisMinificationNode (physics)Energy (signal processing)Routing (electronic design automation)Cluster (spacecraft)Computer networkSelection (genetic algorithm)Energy minimizationRouting protocolDivision (mathematics)Distributed computingArtificial intelligenceElectrical engineeringMathematics

Abstract

fetched live from OpenAlex

We analyze performance of famous cluster based routing protocols and identify the factors affecting energy consumption in wireless sensor networks (WSNs). From theoretical and experimental analysis, it is observed that communication distance and cluster node density are the major sources in the formation of energy and coverage holes. To overcome these deficiencies, we propose a new hybrid approach of static clustering and dynamic selection of cluster heads. We also conduct a comprehensive energy consumption analysis of our technique with selected existing ones. Simulation results show that the proposed technique is relatively better in terms of energy holes minimization and network lifetime prolongation.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.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.012
GPT teacher head0.240
Teacher spread0.227 · 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