MétaCan
Menu
Back to cohort
Record W2101302399 · doi:10.1109/fgcn.2008.107

A Reliable Robust Fully Ad Hoc Data Dissemination Mechanism for Vehicular Networks

2008· article· en· W2101302399 on OpenAlexaff
Kaveh Shafiee, Victor C. M. Leung

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsDisseminationComputer scienceVehicular ad hoc networkWireless ad hoc networkIntersection (aeronautics)Computer networkMechanism (biology)Distributed computingMode (computer interface)Information DisseminationTelecommunicationsEngineeringTransport engineeringWorld Wide WebWireless

Abstract

fetched live from OpenAlex

Many applications in vehicular networks need the data to be disseminated from a source vehicle to a large number of vehicles in the network. Although many solutions to this problem have been previously proposed by the research community, some challenges and failure scenarios have still remained unsolved particularly when the forwarding vehicle is located at the intersections and it wants to disseminate the data to all the intersecting road segments. In this paper, we first evaluate some of the previously proposed directional mode (along the straight roads) data dissemination mechanisms and then integrate the one with the best performance with our novel reliable robust intersection mode data dissemination mechanism in order to come up with a united mechanism for disseminating data both along the straight roads and at intersections. The effectiveness of our proposed mechanism is also verified by performance evaluations.

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 categoriesMeta-epidemiology (narrow)
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.896
Threshold uncertainty score1.000

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.024
GPT teacher head0.227
Teacher spread0.203 · 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.

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

Citations12
Published2008
Admission routes1
Has abstractyes

Explore more

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