Energy-Saving Adaptive Routing for High-Speed Railway Monitoring Network Based on Improved Q Learning

In high-speed railway operational monitoring network systems targeting railway infrastructure as its monitoring objective, there is a wide variety of sensor types with diverse operational requirements. These systems have varying demands on data transmission latency and network lifespan. Most of the...

全面介紹

書目詳細資料
Main Authors: Wei Fu, Qin Peng, Canwei Hu
格式: Article
語言:English
出版: MDPI AG 2023-08-01
叢編:Sensors
主題:
在線閱讀:https://www.mdpi.com/1424-8220/23/17/7393
實物特徵
總結:In high-speed railway operational monitoring network systems targeting railway infrastructure as its monitoring objective, there is a wide variety of sensor types with diverse operational requirements. These systems have varying demands on data transmission latency and network lifespan. Most of the previous research focuses only on prolonging network lifetime or reducing data transmission delays when designing or optimizing routing protocols, without co-designing the two. In addition, due to the harsh operating environment of high-speed railways, when the network changes dynamically, the traditional routing algorithm generates unnecessary redesigns and leads to high overhead. Based on the actual needs of high-speed railway operation environment monitoring, this paper proposes a novel Double Q-values adaptive model combined with the existing reinforcement learning method, which considers the energy balance of the network and real-time data transmission, and constructs energy saving and delay. The two-dimensional reward avoids the extra overhead of maintaining a global routing table while capturing network dynamics. In addition, the adaptive weight coefficient is used to ensure the adaptability of the model to each business of the high-speed railway operation environment monitoring system. Finally, simulations and performance evaluations are carried out and compared with previous studies. The results show that the proposed routing algorithm extends the network lifecycle by 33% compared to the comparison algorithm and achieves good real-time data performance. It also saves energy and has fewer delays than the other three routing protocols in different situations.
ISSN:1424-8220