A Dynamic Addressing Hybrid Routing Mechanism Based on Static Configuration in Urban Rail Transit Ad Hoc Network

• Published in: Electronics (Basel) Vol. 12; no. 17; p. 3571
• Main Authors: Han, Zijie, Liu, Liu, Guo, Zhibin, Su, Zhaoyang, Suo, Lei, Cai, Shiyuan, Han, Haitao
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.09.2023
• Subjects: Ad hoc networks; Ad hoc networks (Computer networks); Algorithms; Communications systems; Configurations; Data transmission; Delay; Infrastructure; Light rail transit; Protocol; Routing (telecommunications); Satellite communications; Urban development; Urban rail; Urbanization; Wireless access points; Wireless communications; Wireless networks; China
• ISSN: 2079-9292; 2079-9292
• DOI: 10.3390/electronics12173571

With the rapid development of urban rail transit, the traditional urban rail wireless network based on fixed infrastructure is not in a position to meet the increasingly complex communication demand. At the same time, Ad Hoc network, as a special wireless mobile network, is developing rapidly. Applying this self-organized networking architecture to the urban rail vehicle–ground communication network can overcome the problems existing in the traditional urban rail communication system. The routing protocols that can achieve low delay and highly reliable data transmission are important in the urban rail transit scenario. Therefore, combined with the wireless Ad Hoc network and the characteristics of the urban rail transit scenario, this paper proposes a dynamic addressing hybrid routing mechanism based on static configuration. Using an improved AODV routing discovery algorithm and then writing the routing table into the router in advance for static configuration not only reduces network overhead but also prolongs the network’s lifetime. It also saves the delay of routing discovery. Then, the cluster head node dynamically monitors the link status, dynamically finds the path when the link needs to be replaced, and selects different update paths according to different types of communication services. Finally, each algorithm’s network performance parameters, like the routing discovery overhead, residual link lifetime, packet delivery rate, throughput, and end-to-end delay, are analyzed and compared.