MétaCan
Menu
Back to cohort
Record W2149063025 · doi:10.1109/glocom.2010.5684058

Delay Analysis for a Reliable Message Delivery in Sparse Vehicular Ad Hoc Networks

2010· article· en· W2149063025 on OpenAlexaff
Atef Abdrabou, Ben Liang, Weihua Zhuang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of WaterlooUniversity of Toronto
Fundersnot available
KeywordsComputer scienceWireless ad hoc networkVehicular ad hoc networkComputer networkReliability (semiconductor)Probabilistic logicFocus (optics)Transmission (telecommunications)Relation (database)Message passingDistributed computingTelecommunicationsData miningWirelessArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, we address the relation between message delivery delay and reliability for the communication between a vehicle and a road side unit (RSU). We focus on sparse or low density vehicular ad hoc networks (VANETs), where timely message delivery and reliable transmission are of significant importance. We present an exact message delivery delay distribution for a two-lane road, where vehicles in one direction act as message carriers for the ones in the other direction and have the freedom to leave the road from randomly distributed exits with a certain probability. Our analysis offers a tool for an intelligent transportation system (ITS) service provider to determine the minimal separation between two consecutive RSUs for meeting a probabilistic requirement of the message delay. Simulation results show the accuracy of our analysis.

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

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.001
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.015
GPT teacher head0.229
Teacher spread0.214 · 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

Citations12
Published2010
Admission routes1
Has abstractyes

Explore more

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