V2V Routing in VANET Based on Heuristic Q-Learning

Designing efficient routing algorithms in vehicular ad hoc networks (VANETs) plays an important role in the emerging intelligent transportation systems. In this paper, a routing algorithm based on the improved Q-learning is proposed for vehicle-to-vehicle (V2V) communications in VANETs. Firstly, a link maintenance time model is established, and the maintenance time is taken as an important parameter in the design of routing algorithm to ensure the reliability of each hop link. Aiming at the low efficiency and slow convergence of Q-learning, heuristic function and evaluation function are introduced to accelerate the update of Q-value of current optimal action, reduce unnecessary exploration, accelerate the convergence speed of Q-learning process and improve learning efficiency. The learning task is dispersed in each vehicle node in the new routing algorithm and it maintains the reliable routing path by periodically exchanging beacon information with surrounding nodes, guides the node’s forwarding action by combining the delay information between nodes to improve the efficiency of data forwarding. The performance of the algorithm is evaluated by NS2 simulator. The results show that the algorithm has a good effect on the package delivery rate and end-to-end delay

V2V Routing in VANET Based on Fuzzy Logic and Reinforcement Learning

To ensure the transmission quality of real-time communications on the road, the research of routing protocol is crucial to improve effectiveness of data transmission in Vehicular Ad Hoc Networks (VANETs). The existing work Q-Learning based routing algorithm, QLAODV, is studied and its problems, including slow convergence speed and low accuracy, are found. Hence, we propose a new routing algorithm FLHQRP by considering the characteristics of real-time communication in VANETs in the paper. The virtual grid is introduced to divide the vehicle network into clusters. The node’s centrality and mobility, and bandwidth efficiency are processed by the Fuzzy Logic system to select the most suitable cluster head (CH) with the stable communication links in the cluster. A new heuristic function is also proposed in FLHQRP algorithm. It takes cluster as the environment state of heuristic Q-learning, by considering the delay to guide the forwarding process of the CH. This can speed up the learning convergence, and reduce the impact of node density on the convergence speed and accuracy of Q-learning. The problem of QLAODV is solved in the proposed algorithm since the experimental results show that FLHQRP has many advantages on delivery rate, end-to-end delay, and average hops in different network scenarios

Performance analysis of communication model on position based routing protocol: Review analysis

Research on the Vanet system has its own challenges and obstacles with the communication system between nodes being the main issue. Four categories in the Vanet system topology, namely position based routing protocols, broadcast based routing protocols, cluster based routing protocols and multicast/geocast routing protocols, have fundamental differences, especially in the concept of sending data and information between nodes. For this reason, in this study, the selection of standardization and integration of data delivery between nodes is of particular relevance. The ability to send data properly in busy and fast traffic conditions is another challenge. For this, there are many variables that must be considered to improve communication between nodes

Developing Intelligent Routing Algorithm over SDN: Reusable Reinforcement Learning Approach

Traffic routing is vital for the proper functioning of the Internet. As users and network traffic increase, researchers try to develop adaptive and intelligent routing algorithms that can fulfill various QoS requirements. Reinforcement Learning (RL) based routing algorithms have shown better performance than traditional approaches. We developed a QoS-aware, reusable RL routing algorithm, RLSR-Routing over SDN. During the learning process, our algorithm ensures loop-free path exploration. While finding the path for one traffic demand (a source destination pair with certain amount of traffic), RLSR-Routing learns the overall network QoS status, which can be used to speed up algorithm convergence when finding the path for other traffic demands. By adapting Segment Routing, our algorithm can achieve flow-based, source packet routing, and reduce communications required between SDN controller and network plane. Our algorithm shows better performance in terms of load balancing than the traditional approaches. It also has faster convergence than the non-reusable RL approach when finding paths for multiple traffic demands