A Cross-Layer Defense Scheme for Edge Intelligence-Enabled CBTC Systems Against MitM Attacks
Bibliographic record
Abstract
While communication-based train control (CBTC) systems play a crucial role in the efficient and reliable operation of urban rail transits, its high penetration level of communication networks opens doors to Man-in-the-Middle (MitM) attacks. Current researches regarding MitM attacks do not consider the characteristics of CBTC systems. Particularly, the limited computing capability of the on-board computers prevents the direct implementation of most existing intrusion detection and defense algorithms against the MitM attack. In order to tackle this dilemma, in this article, we first introduce edge intelligence (EI) into CBTC systems to enhance the computing capability of the system. A cross-layer defense scheme, which includes the detection and defense stages, are proposed next. For the cross-layer detection stage, we propose a Long Short-Term Memory (LSTM) and Support Vector Machine (SVM) based detection method to combine the detection probability calculated from the train control parameter sequence and operation log files. For the cross-layer defense stage, we construct a Bayesian game based defense model to derive the optimal defense policy against MitM attacks. To further improve the accuracy of the defense scheme as well as optimize the communication resource allocation scheme, we propose an optimal communication resource allocation scheme based on the Asynchronous Advantage Actor-Critic (A3C) algorithm at last. Extensive simulation results show that the proposed scheme achieves excellent performance in defending against MitM 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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| 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".