Establishing Strict Priorities in IEEE 802.11p WAVE Vehicular Networks
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.
Bibliographic record
Abstract
The WAVE (Wireless Access in Vehicular Environments) concept includes seven channels within the DSRC band. One of them, known as the Control Channel (CCH), is the one used to exchange all safety-related messages. Messages sent over the CCH have to be processed with different priorities depending on how critical they are for vehicle safety. However, the MAC protocol currently adopted for WAVE, namely EDCA, stops short of that requirement; it does not establish strict priorities, but only relative advantages for some types of messages over the others. Another problem is that, since messages are broadcasted on the CCH, there are no acknowledgments. This means that it is not possible to know whether a transmission was successful or not, which eliminates the possibility to use the binary exponential backoff technique to reduce congestion. In this paper, we propose a simple but effective solution to both of these problems. We use simulations to analyze the performance of the modified MAC protocol and compare it to that of the original EDCA. The results show that the proposed scheme outperforms EDCA. Our comparison focuses on the reduced probability of collision for high-priority frames (gain) and on the increased delays for lower-priority frames (price to pay).
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it