Concepts on Train-to-Ground Wireless Communication System for Hyperloop: Channel, Network Architecture, and Resource Management

Jiachi Zhang, Liu Liu, Botao Han, Zheng Li, Tao Zhou, Kai Wang, Dong Wang and Bo Ai
Additional contact information
Jiachi Zhang: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
Liu Liu: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
Botao Han: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
Zheng Li: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
Tao Zhou: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
Kai Wang: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
Dong Wang: School of Rail Transportation, Shandong Jiaotong University, Jinan 250357, China
Bo Ai: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China

Energies, 2020, vol. 13, issue 17, 1-21

Abstract: Hyperloop is envisioned as a novel transportation way with merits of ultra-high velocity and great traveling comforts. In this paper, we present some concepts on the key technologies dedicated to the train-to-ground communication system based on some prevailing fifth-generation communication (5G) technologies from three aspects: wireless channel, network architecture, and resource management. First, we characterize the wireless channel of the distributed antenna system (DAS) using the propagation-graph channel modelling theory. Simulation reveals that a drastic Doppler shift variation appears when crossing the trackside antenna. Hence, the leaky waveguide system is a promising way to provide a stable receiving signal. In this regard, the radio coverage is briefly estimated. Second, a cloud architecture is utilized to integrate several successive trackside leaky waveguides into a logical cell to reduce the handover frequency. Moreover, based on a many-to-many mapping relationship between distributed units (DUs) and centralized units (CUs), a novel access network architecture is proposed to reduce the inevitable handover cost by using the graph theory. Simulation results show that this scheme can yield a low handover cost. Then, with regards to the ultra-reliable and low latency communication (uRLLC) traffic, a physical resource block (PRB) multiplexing scheme considering the latency requirements of each traffic type is exploited. Simulation presents that this scheme can maximize the throughput of non-critical mission communication services while guaranteeing the requirements of uRLLC traffic. Finally, in terms of the non-critical mission communication services, two cache-based resource management strategies are proposed to boost the throughput and reduce the midhaul link burden by pre-fetching and post-uploading schemes. Simulation demonstrates that the cache-based schemes can boost the throughput dramatically.

Keywords: hyperloop; train-to-ground communication; wireless channel; network architecture; resource management; multiplexing; cache-based strategies (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.mdpi.com/1996-1073/13/17/4309/pdf (application/pdf)
https://www.mdpi.com/1996-1073/13/17/4309/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:13:y:2020:i:17:p:4309-:d:401344

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().