MétaCan
Menu
Back to cohort
Record W3109224004 · doi:10.17762/de.vi.974

The research on a Multipath Forwarding Strategy in Wireless Sensor Networks

2020· article· en· W3109224004 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueDesign Engineering · 2020
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsnot available
Fundersnot available
KeywordsComputer networkComputer sciencePath (computing)Reliability (semiconductor)Multipath propagationWireless sensor networkConnection (principal bundle)Distributed computingQuality of serviceTopology (electrical circuits)Channel (broadcasting)Engineering

Abstract

fetched live from OpenAlex

Wireless communication signals are unstable, WSN network topology changes frequently, network dynamics are strong, and single path forwarding is difficult to provide high quality of service. A vector address-based end-to-end multi-path forwarding mechanism and path recovery algorithm are proposed. Although a single path cannot continuously guarantee network connection, multiple paths together can provide network connection with high reliability. In this method, the caller applies for and stores multiple relatively independent communication paths, and ranks them for use according to the path cost. The experimental results show that the performance of the above method is significantly improved.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.967
Threshold uncertainty score0.647

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.089
GPT teacher head0.285
Teacher spread0.196 · 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