MétaCan
Menu
Back to cohort

A New Loop-Free Proactive Source Routing Scheme for Opportunistic Data Forwarding in Wireless Networks

2011· article· en· W2143548806 on OpenAlex
Zehua Wang, Yuanzhu Chen, Cheng Li

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

VenueIEEE Communications Letters · 2011
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsComputer scienceComputer networkDynamic Source RoutingWireless Routing ProtocolStatic routingLink-state routing protocolZone Routing ProtocolDistributed computingPolicy-based routingRouting protocolMultipath routingGeographic routingRouting (electronic design automation)

Abstract

fetched live from OpenAlex

Opportunistic data forwarding (ODF) has drawn much attention in wireless networking research in recent years. The effectiveness of ODF in wireless networks is heavily depended on the choice of proper routing protocols which can provide effective source routing services. In this paper, we propose a new routing protocol named PSR for ODF in mobile ad-hoc networks. PSR is featured by proactive source routing, loop-free, and extremely small routing overhead. Compared to existing routing protocols, there is no need to timestamp routing updates in PSR and the update messages are harmoniously integrated into the tree structure, so that the overhead can be significantly reduced.

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 categoriesMeta-epidemiology (narrow), Open science
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.990
Threshold uncertainty score1.000

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.001
Open science0.0120.003
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.128
GPT teacher head0.294
Teacher spread0.165 · 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