Next Article in Journal
Exploring the 2-Part of Class Groups in Quadratic Fields: Perspectives on the Cohen–Lenstra Conjectures
Next Article in Special Issue
Scheduling and Evaluation of a Power-Concentrated EMU on a Conventional Intercity Railway Based on the Minimum Connection Time
Previous Article in Journal
Oscillation of Bounded Solutions of Delay Differential Equations
Previous Article in Special Issue
Investigating Autonomous Vehicle Driving Strategies in Highway Ramp Merging Zones
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Dynamic Hierarchical Optimization for Train-to-Train Communication System

1
School of Electronic and Information Engineering, Beihang University, Beijing 100191, China
2
School of Automation and Intelligence, Beijing Jiaotong University, Beijing 100044, China
3
Infrastructure Inspection Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing 100081, China
4
The Key Laboratory of Road and Traffic Engineering in Ministry of Education, Traffic School of Tongji University, Shanghai 200092, China
5
College of Electrical Engineering and Automation, Shandong University of Science and Technology, Qingdao 266590, China
*
Authors to whom correspondence should be addressed.
Mathematics 2025, 13(1), 50; https://doi.org/10.3390/math13010050
Submission received: 19 November 2024 / Revised: 22 December 2024 / Accepted: 24 December 2024 / Published: 26 December 2024

Abstract

To enhance the operational efficiency of high-speed trains (HSTs), Train-to-Train (T2T) communication has received considerable attention. This paper introduces a T2T cooperative communication model that allows direct information exchange between HSTs, enhancing communication efficiency and system performance. The model incorporates a mix of dynamic and static nodes, and within this framework, we have developed a novel Dynamic Hierarchical Algorithm (DHA) to optimize communication paths. The DHA combines the stability of traditional algorithms with the flexibility of machine learning to adapt to changing network topologies. Furthermore, a communication link quality assessment function is proposed based on stochastic network calculus, which accounts for channel randomness, allowing for a more precise adaptation to the actual channel environment. Simulation results demonstrate that DHA has superior performance in terms of optimization time and effect, particularly in large-scale and highly dynamic network environments. The algorithm’s effectiveness is validated through comparative analysis with traditional and machine learning-based approaches, showing significant improvements in optimization efficiency as the network size and dynamics increase.
Keywords: T2T cooperative communication; communication path optimization; dynamic hierarchical algorithm; stochastic network calculus T2T cooperative communication; communication path optimization; dynamic hierarchical algorithm; stochastic network calculus

Share and Cite

MDPI and ACS Style

Song, H.; Xu, M.; Cheng, Y.; Zeng, X.; Dong, H. Dynamic Hierarchical Optimization for Train-to-Train Communication System. Mathematics 2025, 13, 50. https://doi.org/10.3390/math13010050

AMA Style

Song H, Xu M, Cheng Y, Zeng X, Dong H. Dynamic Hierarchical Optimization for Train-to-Train Communication System. Mathematics. 2025; 13(1):50. https://doi.org/10.3390/math13010050

Chicago/Turabian Style

Song, Haifeng, Mingxuan Xu, Yu Cheng, Xiaoqing Zeng, and Hairong Dong. 2025. "Dynamic Hierarchical Optimization for Train-to-Train Communication System" Mathematics 13, no. 1: 50. https://doi.org/10.3390/math13010050

APA Style

Song, H., Xu, M., Cheng, Y., Zeng, X., & Dong, H. (2025). Dynamic Hierarchical Optimization for Train-to-Train Communication System. Mathematics, 13(1), 50. https://doi.org/10.3390/math13010050

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop