MétaCan
Menu
Back to cohort
Record W2161047006 · doi:10.1109/glocom.2009.5425221

SARP - A Novel Multi-Copy Routing Protocol for Intermittently Connected Mobile Networks

2009· article· en· W2161047006 on OpenAlex
Ahmed Elwhishi, Pin‐Han Ho

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
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceComputer networkRouting protocolProtocol (science)Zone Routing ProtocolRouting (electronic design automation)Wireless Routing Protocol

Abstract

fetched live from OpenAlex

This paper introduces a multi-copy routing protocol, called Self Adaptive Routing Protocol (SARP), for intermittently connected mobile networks. SARP aims to exploring the possibility of taking nodes as carriers of messages to be delivered among network partitions. The choice of the best carrier for a message is made according to the prediction based on the history of nodal encounters. The paper will argue that the movement of the nodes and their possible future collocation with the recipient of the messages can be used to make intelligent message forwarding decisions. The proposed protocol has been implemented and compared to a number of existing encounter-based routing approaches, where a near-realistic mobility model is used for testing. The performance of the proposed technique is evaluated in terms of delivery delay and the number of transmissions performed. The results of the simulation show that the proposed technique outperforms all existing multi-copy encounter-based routing protocols. Index terms: DTN, multi-copy routing.

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

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.052
GPT teacher head0.331
Teacher spread0.278 · 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

Citations27
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207