MétaCan
Menu
Back to cohort
Record W2148983053 · doi:10.1109/icc.2009.5198623

A Link-Reliability-Based Approach to Providing QoS Support for VANETs

2009· article· en· W2148983053 on OpenAlexaff
Azzedine Boukerche, Cristiano Rezende, Richard W. Pazzi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceComputer networkQuality of serviceUnicastReliability (semiconductor)Network packetJitterRelayWireless ad hoc networkLatency (audio)Bandwidth (computing)WirelessDistributed computingTelecommunications

Abstract

fetched live from OpenAlex

Vehicular Ad Hoc Networks are a promising technology that provides several interesting new functionalities to drivers and passengers. These services are spread through a wide variety of applications, each with specific requirements in terms of latency, jitter and bandwidth, among other metrics. For this reason, it is crucial to provide mechanisms that can be used to offer different levels of communication quality in order to achieve reasonable performance in all services. In this paper, we demonstrate how link reliability may be used to support Quality of Service policies for any protocol based on unicast packets relay. This article is divided into two parts, the first of which describes how we estimate link reliability and evaluates how these estimations can be used to classify links into different groups with distinct quality. In the second part, this link reliability estimation model is used to group links into queues with different levels of expected transmission success ratios, which can be used to provide different quality levels depending on the requirements of each individual service. We show that the proposed mechanism adds little-to-none overhead to the overall network and provides an effective mean of supporting QoS in VANETs.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0030.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0010.001

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.011
GPT teacher head0.222
Teacher spread0.211 · 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 source (direct Gemma or distilled Codex), not a consensus.

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

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

Citations19
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicVehicular Ad Hoc Networks (VANETs)French-language works237,207