Trust-centric Detection of Roadside Unit Misbehaviour in VANETs
Bibliographic record
Abstract
Numerous concerns exist across the various components in the ever-evolving field of Vehicular Networks. Still, the one that is specifically crucial in managing network traffic and data exchange is Road Side Units (RSUs). These devices ensure robust and reliable communication between various components in VANETs. They are also susceptible to misbehaviours that could compromise the entire network’s integrity. Given the critical nature of these, it becomes crucial to detect the misbehaviour. Hence, in this research, we have developed a trust-based model for detecting RSU misbehaviour in VANETs. We identified the limitations and challenges in the existing trust models. Our trust model mainly focused on RSU to RSU (R2R) and RSU to Trust Authority (R2T) communication. The methodology involves designing a global trust model in which an RSU assesses the trustworthiness of another RSU locally based on direct interactions and recommendations from other RSUs and the Trust Authority. Then, the total trust is calculated and sent to the trust authority, which aggregates these trust assessments from individual RSUs to adjust the global trust values of RSUs dynamically. The effectiveness of this model was evaluated by carrying out simulations and test scenarios with different percentages of compromised RSUs to assess the model’s responsiveness and reliability.
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.003 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 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.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 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 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".