MétaCan
Menu
Back to cohort
Record W2008338383 · doi:10.1145/1185373.1185404

Cluster-based routing protocol for mobile sensor networks

2006· article· en· W2008338383 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 institutionsUniversity of Guelph
Fundersnot available
KeywordsComputer networkComputer scienceWireless Routing ProtocolRouting protocolZone Routing ProtocolDynamic Source RoutingEnhanced Interior Gateway Routing ProtocolLink-state routing protocolDistributed computingInterior gateway protocolBase stationRouting (electronic design automation)Routing Information ProtocolProtocol (science)

Abstract

fetched live from OpenAlex

Mobility in wireless sensor networks has attracted a lot of attention in the recent years [6] and has introduced unique challenges in aspects like resource management, coverage, routing protocols, security, etc. The next evolutionary step for sensor networks is to handle the mobility effect in all its forms. In this paper, we propose a mobility-aware routing protocol, using zone-base information and a cluster-like communication between nodes. The routing protocol has two different stages: Route Creation and Route Preservation. Route creation is used to discover a route from source to destination. Route preservation is used to repair the route when it is defective.

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: Methods
Teacher disagreement score0.468
Threshold uncertainty score0.822

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.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.013
GPT teacher head0.264
Teacher spread0.252 · 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