Machine Learning Based Misbehaviour Detection in VANET Using Consecutive BSM Approach
Bibliographic record
Abstract
Vehicular ad-hoc network (VANET) is an emerging technology for vehicle-to-vehicle communication vital for reducing road accidents and traffic congestion in an Intelligent Transportation System (ITS). VANET communication is vulnerable to various attacks and cryptographic techniques are commonly used for message integrity and authentication of vehicles. However, cryptograhpic techniques alone may not be sufficient to protect against insider attacks. Many VANET safety applications rely on periodic broadcast of basic safety messages (BSMs) from surrounding vehicles that contain important status information about a vehicle such as its position, speed, and heading. If an attacker (misbehaving vehicle) injects false position information in a BSM, it can lead to serious consequences including traffic congestion or even accidents. Therefore, it is imperative to accurately detect and identify such attackers to ensure safety in the network. This paper presents a novel data-centric approach to detectposition falsificationattacks, using machine learning (ML) algorithms. Unlike existing techniques, the proposed approach combines information from 2 consecutive BSMs for training and testing. Simulations using the Vehicular Reference Misbehavior (VeReMi) dataset demonstrate that the proposed model clearly outperforms existing approaches for identifying a range of different attack types.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".