State-of-the-Art VANET Trust Models: Challenges and Recommendations
Bibliographic record
Abstract
Research on trust models in Vehicular Ad-hoc Networks (VANET) was mainly focused on entity-centric, data-centric, and combined trust models until the latter half of the previous decade. There are a number of attacks these conventional trust models cannot hold back. The popularity of blockchain technology in the last few years resulted in the research on blockchain-based trust management models for VANET. Meanwhile, zero trust solutions claimed to overcome the problems of the traditional perimeter security model. With the perimeter security model, information systems within an organization's internal network are inherently trusted and the ones that belong outside the organization are consequently deemed untrusted. The zero trust architecture overcomes these flaws by simply not trusting any entity regardless of the entity belonging inside the organization's perimeter or outside. This paper discusses the various trust management models for VANET, their drawbacks and proposes a private blockchain technology to improve the performance and highlight the need for a central governing authority. The paper also investigates the challenges of implementing a zero-trust architecture for vehicular communications and brings forth the idea of using the concepts of zero trust to provide state-of-the-art security for VANET's supporting infrastructure. Additionally, this study surveys the benefits and challenges of developing the VANET architecture based on software-defined networking (SDN).
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.007 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.005 | 0.020 |
| Open science | 0.004 | 0.003 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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".