A Clustering Algorithm Based on Node Cost and Service Priority for Urban Rail In-Vehicle Ad-Hoc Network

Urban rail transit has become an important way for people to travel. The traditional urban rail transit system has fixed infrastructure, relies on base stations for communication, and has poor network robustness. The ad-hoc network has developed rapidly in recent years due to its high stability. And it can be used in urban rail to improve the performance of communication networks. In this paper, a clustering algorithm based on urban rail in-vehicle ad-hoc networks is proposed. The algorithm includes cluster head selected strategy and low-delay queuing strategy. We introduce the network architecture and algorithm theory in detail, and verify the algorithm performance in terms of end-to-end delay and packet loss rate through simulation. As the result, the algorithm can effectively improve communication efficiency and reliability.