MétaCan
Menu
Back to cohort
Record W1663565304 · doi:10.5555/2147671.2147714

Cross-layer cluster-based data dissemination for failure detection in MANETs

2011· article· en· W1663565304 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

VenueConference on Network and Service Management · 2011
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsWestern UniversityInnovation, Science and Economic Development Canada
Fundersnot available
KeywordsComputer scienceComputer networkGossipNode (physics)Network layerOverhead (engineering)DisseminationDistributed computingWireless sensor networkFlooding (psychology)Layer (electronics)Engineering

Abstract

fetched live from OpenAlex

Node failures may be frequent in MANETs, but there can be many different causes for those failures. Nodes may lose power, crash, or simply move out of range of other nodes in the network. Identifying the root cause is complicated by a lack of fixed monitoring and analysis infrastructure. Past research has focused on monitoring using either ping, heartbeat, or gossip-based approaches, which can incur significant network wide overhead. This paper proposes a novel k-hop cluster based data dissemination scheme that can piggyback on routing messages for more efficient detection of failures including node disconnection. In this scheme, nodes forward their neighbour-hood observations to a per-cluster failure detector based on the observed spanning tree. Simulations show that detecting disconnected nodes using a cross-layer implementation of the data dissemination scheme is more efficient while an application layer implementation is faster. This effect is more pronounced in sparse networks.

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.970
Threshold uncertainty score0.760

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.057
GPT teacher head0.290
Teacher spread0.233 · 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