MétaCan
Menu
Back to cohort
Record W2127274645 · doi:10.1109/icwmc.2006.28

Base Station Assisted Hierarchical Cluster-Based Routing

2006· article· en· W2127274645 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsAcadia University
Fundersnot available
KeywordsBase stationComputer scienceComputer networkRouting protocolEnergy consumptionWireless sensor networkSet (abstract data type)Hierarchical routingCluster analysisRouting (electronic design automation)Cluster (spacecraft)Base (topology)HeadsetDistributed computingWireless Routing ProtocolEngineeringTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

Wireless sensor networks (WSNs) are commonly used for continuously monitoring applications. This paper investigates a base station assisted energy efficient routing for hierarchical clusters. The base station determines the number of clusters and the initial set of headset members. Moreover, instead of a single cluster head, a set of associates called a head-set manages the network clusters. The head-set approach not only optimizes energy consumption by reducing the number of elections but evenly distributes the long-range transmissions among the network nodes. Due to the controlled addition of redundant associates, the network is available for longer number of transmissions. The simulation results show that the proposed protocol outperforms the traditional clustering techniques.

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: Methods · Consensus signal: none
Teacher disagreement score0.716
Threshold uncertainty score0.487

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.225
Teacher spread0.213 · 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

Quick stats

Citations50
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207