CBTC DCS Based on LTE Unlicensed Wireless Access: Assessment of Coexistence Performance With Wi-Fi
Bibliographic record
Abstract
As the existing communication technologies which for about a decade have supported railway operations and the huge transition from conventional to modern communication-based signaling approach the extent of their performance capabilities, the railway industry strives to migrate to a proven solution aiming to support the new and diverse broadband services and reduce cost. Long Term Evolution (LTE) radio access technology has been globally accepted because of the unparalleled performance, off-the-shelf convenience, and well-developed standardization. An LTE solution, however, brings both the opportunities and challenges to a Data Communication System (DCS) underlying a Communication-Based Train Control (CBTC) system. The presented research targets one of the main LTE deployment challenges; the spectrum availability. To cope with the increasing scarcity of spectrum resources, LTE/LTE-A has envisaged an extension to the unlicensed band which is already heavily populated with incompatible legacy systems such as the immensely popular Wi-Fi networks. In this paper, a design framework is established to dimension the LTE system according to the CBTC DCS sub-system level requirements. Furthermore, the LTE/Wi-Fi coexistence performance is evaluated and studied in a train control application’s context by using a Markov chain analysis approach.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".