Cross-Layer Defense Methods for Jamming-Resistant CBTC Systems
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
Communication-based Train Control (CBTC) systems are the burgeoning directions for developing future train control systems. With the adoption of wireless communication and network techniques, train control systems are more vulnerable to cyber-attacks. Notably, the jamming attacks, aiming at the handoff process that is the weakest part of train ground communication systems, will cause long disruption of communication. It will have a severe impact on train control operation efficiency. Current research regarding industry control system security is hard to model the impact of the jamming attacks on the train control system quantitatively, and current countermeasure schemes against jamming attacks are not designed for the operating mechanism of train control systems. This paper first builds the train control security state transition probability model under jamming attacks. A cross-layer defense scheme is then proposed from the aspect of the physical layer, the cyber layer and the management layer. In the physical layer, this paper designs a model prediction control algorithm to track dynamic target signals, in the hopes of eventually tracking the dynamic target quickly and smoothly. In the cyber layer, a multi-stage and zero-sum stochastic game model is built for the channel selection for the attack and the defense, whereby the channel selection randomized policy will be obtained. In the management layer, a dynamic train travel speed profile generation algorithm is proposed to mitigate the jamming attacks’ impact on train control systems. Extensive simulation results are shown that jamming attack impact on CBTC can be mitigated effectively with our proposed cross-layer defense 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.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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