MétaCan
Menu
Back to cohort
Record W2140389544 · doi:10.1109/icc.2008.614

A Dependable Clustering Protocol for Survivable Underwater Sensor Networks

2008· article· en· W2140389544 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
FieldEngineering
TopicUnderwater Vehicles and Communication Systems
Canadian institutionsUniversity of OttawaMemorial University of Newfoundland
Fundersnot available
KeywordsBackupSurvivabilityComputer scienceCluster analysisComputer networkNode (physics)Protocol (science)Cluster (spacecraft)Wireless sensor networkDistributed computingRouting protocolEvent (particle physics)EngineeringRouting (electronic design automation)

Abstract

fetched live from OpenAlex

Node clustering has been widely considered in underwater sensor networks (UWSNs) to improve energy efficiency and prolong network lifetime. Network survivability is a great concern in cluster-based UWSNs. In this paper, we propose a dependable clustering protocol to provide a survivable cluster hierarchy against cluster-head failures in such networks. The proposed clustering protocol attempts to select a primary cluster head and a backup cluster head during clustering so that the cluster members associated with the failed cluster head can quickly switch over to the backup cluster head in the event of a cluster-head failure. Meanwhile, it attempts to select a set of clusters with minimum total cost so that network lifetime can be prolonged to ensure long-term underwater environmental monitoring. Simulation results show that the protocol can effectively enhance network survivability and improve network capacity in the event of cluster-head failures.

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.910
Threshold uncertainty score0.468

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