MétaCan
Menu
Back to cohort
Record W1564455055 · doi:10.1109/wimob.2005.1512889

Routing overhead analysis for reactive routing protocols in wireless ad hoc networks

2006· article· en· W1564455055 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsComputer networkComputer scienceWireless Routing ProtocolOptimized Link State Routing ProtocolWireless ad hoc networkAd hoc wireless distribution serviceDynamic Source RoutingLink-state routing protocolAdaptive quality of service multi-hop routingZone Routing ProtocolRouting protocolRouting (electronic design automation)WirelessTelecommunications

Abstract

fetched live from OpenAlex

Although several routing protocols have been proposed that can be used in mobile ad hoc networks, there is very little formal analysis that considers the communication overhead or in other word routing overhead for these procedures. This paper provides a new mathematical framework for quantifying the overhead of reactive routing protocols such as dynamic source routing (DSR) and ad hoc on-demand distance vector routing (AODV) in wireless ad hoc networks with random location of the nodes. The analysis is compared with the simulations and found to match with the simulation results . The result of this study can be used to predict scalability properties of routing protocols.

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

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.002
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.018
GPT teacher head0.277
Teacher spread0.259 · 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

Citations46
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207