MétaCan
Menu
Back to cohort
Record W1503049715 · doi:10.1109/wimob.2005.1512903

Quality of service for ad hoc on-demand distance vector routing

2006· article· en· W1503049715 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 Victoria
Fundersnot available
KeywordsComputer networkAd hoc On-Demand Distance Vector RoutingComputer scienceQuality of serviceDistance-vector routing protocolDynamic Source RoutingMobile ad hoc networkOptimized Link State Routing ProtocolDestination-Sequenced Distance Vector routingAdaptive quality of service multi-hop routingRouting protocolWireless ad hoc networkNetwork packetDistributed computingWirelessTelecommunications

Abstract

fetched live from OpenAlex

Quality-of-service (QoS) is a desirable feature for mobile ad hoc networks (MANETs) due to the growth of multimedia applications. However, the mobile nature and dynamic topology of MANETs make it difficult to provide QoS assurance in such networks. In this paper we propose a QoS routing protocol based on AODV (QS-AODV), which creates routes according to application QoS requirements. A local repair mechanism is used to improve the packet delivery ratio. It is shown that QS-AODV provides performance comparable to AODV under light traffic conditions. In heavy traffic, QS-AODV provides higher packet delivery ratios and lower routing overheads, at a cost of slightly longer end-to-end delays. The effects of mobility on performance is also presented.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.932
Threshold uncertainty score0.360

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.022
GPT teacher head0.276
Teacher spread0.254 · 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

Citations82
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207