Modeling and Analysis for Emergency Messaging Delay in Vehicular Ad Hoc Networks
Bibliographic record
Abstract
Road crashes, occurring at a high annual rate for many years, demand improvements in transportation systems to provide a high level of on-road safety. Implanting smart sensors, communication capabilities, memory storage and information processing units in vehicles are important components of Intelligent Transportation Systems (ITS). ITS should enable the communication between vehicles and allow cooperative driving and early warnings of sudden breaks and accidents ahead. The prompt availability of the emergency information will provide the driver a time to react in order to avoid possible accidents ahead. Hence, information delivery delay is an importance quality-of-service (QoS) metric in such applications. In this thesis, we focus on modeling the delay for emergency messaging in vehicular ad hoc networks (VANETs). VANETs consist of nodes moving with very high speeds, resulting in frequent topological changes. As a result, many existing models and packet forwarding schemes designed for general purpose mobile ad hoc networks (MANETs) cannot be directly applied to VANETs. \nIn our system model, we consider mobility and traffic density of vehicles. We focus on studying the effect of the traffic flow density on the delay of emergency message dissemination. Hence, traffic flow theories developed by civil engineers form the base of our modeling. \nThe common way of emergency message dissemination in VANETs is broadcasting. To overcome the broadcasting storm problem and improve scalability of such large networks, we adopt a node cluster based broadcasting mechanism. This research provides a realistic mathematical model for the broadcasting delay, which accounts for the randomness in user mobility and matches the highly dynamic nature of VANETs. An investigation on the minimum cluster size that achieves acceptable message delivery latency is provided. It is shown that network control and performance parameters are dependent on the traffic density. Experimental measurement data are used to demonstrate the accuracy of the mathematical modeling.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".