MétaCan
Menu
Back to cohort
Record W6986853583

Reliable Broadcast of Safety Messages in Vehicular Ad hoc Networks

2008· dissertation· en· W6986853583 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueTSpace · 2008
Typedissertation
Languageen
FieldComputer Science
TopicVideo Coding and Compression Technologies
Canadian institutionsnot available
FundersAUTO21 Network of Centres of Excellence
KeywordsProtocol (science)Atomic broadcastVehicular ad hoc networkCoding (social sciences)Broadcast radiationWireless ad hoc networkLinear network codingBroadcast communication networkVehicular communication systems
DOInot available

Abstract

fetched live from OpenAlex

Broadcast communications is critically important in vehicular networks. Many safety applications need safety warning messages to be broadcast to all vehicles present in an area. In this thesis, we propose a novel repetition-based broadcast protocol based on ``optical orthogonal codes.'' Optical orthogonal codes are used because of their ability to reduce the possibility of collision. We present a detailed mathematical analysis for obtaining the probability of success and the average delay. Furthermore, we propose to use coding to increase network throughput, and ``adaptive elimination'' of potentially colliding transmissions to further increase reliability. We show, by analysis and simulations, that the proposed protocol outperforms existing repetition-based ones and provides reliable broadcast communications and can reliably deliver safety messages under load conditions deemed to be common in vehicular environments. We also show that the proposed protocol is able to provide different levels of quality of service.

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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.854
Threshold uncertainty score0.958

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.285
Teacher spread0.270 · 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