MétaCan
Menu
Back to cohort
Record W1994983146 · doi:10.1109/glocom.2012.6503983

Finite state Markov modelling for high speed railway wireless communication channel

2012· article· en· W1994983146 on OpenAlexaff
Siyu Lin, Zhangdui Zhong, Lin Cai, Yuanqian Luo

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Network Optimization
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsComputer scienceWirelessComputer networkChannel (broadcasting)Markov chainHandoverFadingMarkov modelMarkov processPath lossWireless networkDistributed computingKey (lock)Mobility modelTelecommunications

Abstract

fetched live from OpenAlex

How to provide reliable, cost-effective wireless services for high-speed railway (HSR) users attracts increasing attention due to the fast deployment of HSRs worldwide. A key issue is to develop reasonably accurate and mathematically tractable models for HSR wireless communication channels. Finite-state Markov chains (FSMCs) have been extensively investigated to describe wireless channels. However, different from traditional wireless communication channels, HSR communication channels have the unique features such as very high speed, deterministic mobility pattern and frequent handoff events, which are not described by the existing FSMC models. In this paper, based on the Winner II physical layer channel model parameters, we propose a novel FSMC channel model for HSR communication systems, considering the path loss, fast fading and shadowing with high mobility. Extensive simulation results are given, which validate the accuracy of the proposed FSMC channel model. The model is not only ready for performance analysis, protocol design and optimization for HSR communication systems, but also provides an effective tool for faster HSR communication network simulation.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.027
Threshold uncertainty score0.053

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0040.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.

Opus teacher head0.019
GPT teacher head0.222
Teacher spread0.203 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations50
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Network OptimizationFrench-language works237,207