A Review of Security Strategies used in Vehicular Adhoc Networks
Bibliographic record
Abstract
This is a review of various aspects of security strategies used for Vehicular Adhoc Networks. In this paper we will be exploring the different threats to system security seen in a Vehicular Adhoc Network Subsystem and their corresponding solutions. Vehicular adhoc networks comprises methods by which Vehicles can communicate with each other either in an independent or adhoc manner or through a designated third-party intermediate node referred to as "Road Side Unit". Given the domain, the connection between the devices is wireless. The security challenges in Vehicular Adhoc Networks are similar to those associated with Wireless Technologies and Distributed Computing. In this document we shall be looking into cases regarding Certificate based authentication and usage of basic PKI Infrastructure, Sybil attacks, Invalid Certificate Revocation Methods, Black Hole attacks, Gray Hole Attacks, Worm Hole Attacks, Jelly Fish Attack and Spoofing. We shall also be looking into Adhoc Routing Protocols like Adhoc On Demand Distance Vector Routing protocol (AODV) and methods to prevent Black Hole and related attacks.
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.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.004 | 0.005 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".