With the rapid development of the Internet of vehicles (IoV), routing in vehicular ad hoc networks (VANETs) has become a popular research topic. Due to the features of the dynamic network structure, constraints of road topology and variable states of vehicle nodes, VANET routing protocols face many challenges, including intermittent connectivity, large delay and high communication overhead. Location-based geographic routing is the most suitable method for VANETs, and such routing performs well on paths with an appropriate vehicle density and network load. We propose an intersection-based V2X routing protocol that includes a learning routing strategy based on historical traffic flows via Q-learning and monitoring real-time network status. The hierarchical routing protocol consists of two parts: a multidimensional Q-table, which is established to select the optimal road segments for packet forwarding at intersections; and an improved greedy strategy, which is implemented to select the optimal relays on paths. The monitoring models can detect network load and adjust routing decisions in a timely manner to prevent network congestion. This method minimizes the communication overhead and latency and ensures reliable transmission of packets. We compare our algorithm with three benchmark algorithms in an extensive simulation. The results show that our algorithm outperforms the existing methods in terms of network performance, including packet delivery ratio, end-to-end delay, and communication overhead.
Intersection-Based V2X Routing via Reinforcement Learning in Vehicular Ad Hoc Networks
IEEE Transactions on Intelligent Transportation Systems ; 23 , 6 ; 5446-5459
2022-06-01
5116832 byte
Article (Journal)
Electronic Resource
English
Intersection management using vehicular networks
Automotive engineering | 2012
|Intersection Management using Vehicular Networks
British Library Conference Proceedings | 2012
|