IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2024i1p50-d1554126.html
   My bibliography  Save this article

Dynamic Hierarchical Optimization for Train-to-Train Communication System

Author

Listed:
  • Haifeng Song

    (School of Electronic and Information Engineering, Beihang University, Beijing 100191, China
    School of Automation and Intelligence, Beijing Jiaotong University, Beijing 100044, China)

  • Mingxuan Xu

    (School of Automation and Intelligence, Beijing Jiaotong University, Beijing 100044, China)

  • Yu Cheng

    (Infrastructure Inspection Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing 100081, China)

  • Xiaoqing Zeng

    (The Key Laboratory of Road and Traffic Engineering in Ministry of Education, Traffic School of Tongji University, Shanghai 200092, China)

  • Hairong Dong

    (College of Electrical Engineering and Automation, Shandong University of Science and Technology, Qingdao 266590, China)

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.

Suggested Citation

  • Haifeng Song & Mingxuan Xu & Yu Cheng & Xiaoqing Zeng & Hairong Dong, 2024. "Dynamic Hierarchical Optimization for Train-to-Train Communication System," Mathematics, MDPI, vol. 13(1), pages 1-21, December.
  • Handle: RePEc:gam:jmathe:v:13:y:2024:i:1:p:50-:d:1554126
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/1/50/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/1/50/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2024:i:1:p:50-:d:1554126. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.