Artificial Intelligence (AI)-Empowered Intrusion Detection Architecture for the Internet of Vehicles
Bibliographic record
Abstract
Recent advances in the Internet of Things (IoT) and the adoption of IoT in vehicular networks have led to a new and promising paradigm called the Internet of Vehicles (IoV). However, the mode of communication in IoV being wireless in nature poses serious cybersecurity challenges. With many vehicles being connected in the IoV network, the vehicular data is set to explode. Traditional intrusion detection techniques may not be suitable in these scenarios with an extremely large amount of vehicular data being generated at an unprecedented rate and with various types of cybersecurity attacks being launched. Thus, there is a need for the development of advanced intrusion detection techniques capable of handling possible cyberattacks in these networks. Toward this end, we present an artificial intelligence (AI)-based intrusion detection architecture comprising Deep Learning Engines (DLEs) for identification and classification of the vehicular traffic in the IoV networks into potential cyberattack types. Also, taking into consideration the mobility of the vehicles and the realtime requirements of the IoV networks, these DLEs will be deployed on Multi-access Edge Computing (MEC) servers instead of running on the remote cloud. Extensive experimental results using popular evaluation metrics and average prediction time on a MEC testbed demonstrate the effectiveness of the proposed scheme.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.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".