AHDNN: Attention-Enabled Hierarchical Deep Neural Network Framework for Enhancing Security of Connected and Autonomous Vehicles
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The usage of the Internet of Things (IoT) in the field of transportation appears to have immense potential. Intelligent vehicle systems can exchange seamless information to assist cars to ensure better traffic control and road safety. The dynamic topology of this network, connecting a large number of vehicles, makes it vulnerable to several threats like authentication, data integrity, confidentiality, etc. These threats jeopardize the safety of vehicles, riders, and the entire system. Researchers are developing several approaches to combat security threats in connected and autonomous vehicles. Artificial Intelligence is being used by both scientists and hackers for protecting and attacking the networks, respectively. Nevertheless, wirelessly coupled cars on the network are in constant peril. This motivated us to develop an intrusion detection model that can be run in low-end devices with low processing and memory capacity and can prevent security threats and protect the connected vehicle network. This research paper presents an Attention-enabled Hierarchical Deep Neural Network (AHDNN) as a solution to detect intrusion and ensure autonomous vehicles’ security both at the nodes and at the network level. The proposed AHDNN framework has a very low false negative rate of 0.012 ensuring a very low rate of missing an intrusion in normal communication. This enables enhanced security in vehicular networks.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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 it