A deep learning based misbehavior classification scheme for intrusion detection in cooperative intelligent transportation systems
Bibliographic record
Abstract
With the rise of the Internet of Vehicles (IoV) and the number of connected vehicles increasing on the roads, Cooperative Intelligent Transportation Systems (C-ITSs) have become an important area of research. As the number of Vehicle to Vehicle (V2V) and Vehicle to Interface (V2I) communication links increases, the amount of data received and processed in the network also increases. In addition, networking interfaces need to be made more secure for which existing cryptography-based security schemes may not be sufficient. Thus, there is a need to augment them with intelligent network intrusion detection techniques. Some machine learning-based intrusion detection and anomaly detection techniques for vehicular networks have been proposed in recent times. However, given the expected large network size, there is a necessity for extensive data processing for use in such anomaly detection methods. Deep learning solutions are lucrative options as they remove the necessity for feature selection. Therefore, with the amount of vehicular network traffic increasing at an unprecedented rate in the C-ITS scenario, the need for deep learning-based techniques is all the more heightened. This work presents three deep learning-based misbehavior classification schemes for intrusion detection in IoV networks using Long Short Term Memory (LSTM) and Convolutional Neural Networks (CNNs). The proposed Deep Learning Classification Engines (DCLE) comprise of single or multi-step classification done by deep learning models that are deployed on the vehicular edge servers. Vehicular data received by the Road Side Units (RSUs) is pre-processed and forwarded to the edge server for classifications following the three classification schemes proposed in this paper. The proposed classifiers identify 18 different vehicular behavior types, the F1-scores ranging from 95.58% to 96.75%, much higher than the existing works. By running the classifiers on testbeds emulating edge servers, the prediction performance and prediction time comparison of the proposed scheme is compared with those of the existing studies.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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.001 | 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".