MétaCan
Menu
Back to cohort
Record W6989402890

AnonDSR: Efficient Anonymous Dynamic Source Routing for Mobile Ad-Hoc Networks

2005· article· en· W6989402890 on OpenAlexvenueno aff

Bibliographic record

VenueNPARC · 2005
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsnot available
Fundersnot available
KeywordsRouting protocolDynamic Source RoutingWireless Routing ProtocolAnonymityLink-state routing protocolRouting (electronic design automation)Wireless ad hoc networkOptimized Link State Routing Protocol
DOInot available

Abstract

fetched live from OpenAlex

Security, anonymity, and scalability are still important issues for mobile ad hoc network routing protocols. We first expose the limitations of several existing mobile ad hoc network routing protocols with security and anonymity constraints and analyze their scalabilities. Based on the analysis, we propose a new anonymous dynamic source routing protocol (AnonDSR) to provide three levels of security protection. We compare their scalabilities with security constraints, and analyze the new protocol to show it has strong security and anonymity protection, and very good scalability.

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.

How this classification was reachedexpand

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.905
Threshold uncertainty score0.974

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.009
GPT teacher head0.234
Teacher spread0.225 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2005
Admission routes1
Has abstractyes

Explore more

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