Handoff Performance Improvements in MIMO-Enabled Communication-Based Train Control Systems
Bibliographic record
Abstract
Communication-based train control (CBTC) is an automated control system for railways using data communications. CBTC systems have stringent communication latency requirements. For rail transit systems, wireless local area network (WLAN)-based CBTC is a popular approach due to the wide availability of commercial-off-the-shelf WLAN equipment. However, WLANs were not originally designed for high-speed environments with frequent handoffs, which may result in communication interrupt and long latency. In this paper, we propose a handoff scheme in CBTC systems based on WLANs with multiple-input-multiple-output (MIMO) technologies to improve the handoff latency performance. In particular, we consider channel estimation errors and the tradeoff between MIMO multiplexing gain and diversity gain in making handoff decisions. The handoff problem is formulated as a partially observable Markov decision process (POMDP), and the optimal handoff policy can be derived to minimize the handoff latency. Simulations results based on real field channel measurements are presented to show the effectiveness of the proposed 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.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 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".