A Novel Overlay Token Ring Protocol for Inter-Vehicle Communication
Bibliographic record
Abstract
Reliable and fast message dissemination for safety application and quality-of-service (QoS) guarantee for data service are considered to be the most demanding requirements in vehicle ad-hoc networks. Current medium access control (MAC) protocols are insufficient to meet both requirements, while the standardization process is still ongoing. In this paper, an overlay token ring protocol (OTRP) is proposed for inter-vehicle communication (IVC). In the OTRP, the vehicular network is considered as overlapped virtual rings, each of which has a token passed in the ring as the right for transmission. The ring structure is dynamically adjusted according to the movements of vehicles. A salient feature of the OTRP is that two operation modes, namely the normal and emergency modes, are devised, whereby timely emergency message dissemination is guaranteed and desired quality-of-service (QoS) for data service can be provided. Theoretical analysis and simulations under saturated traffic condition are conducted. The results show that the OTRP can meet the stringent requirements of vehicle communications with fast and reliable emergency message broadcasting.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 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.002 | 0.001 |
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".