Answers are grounded in this paper and cite their sources.
This paper proposes a new hybrid routing algorithm, ReLeVR, for vehicular ad hoc networks (VANETs). Our algorithm aims to efficiently solve the problem of routing messages from vehicles to specific geographical locations over VANETs. We assume that a VANET consists of vehicles and roadside units (RSUs). First, we propose a simple strategy to find the optimal locations for RSUs with the objective of minimizing their number. Our strategy computes RSU locations using available prior traffic information. Then we use Q-learning, a reinforcement learning algorithm, to learn from traffic flow patterns and compute a routing policy for the vehicles. This policy determines which grid the message should be sent to in the next step along the way for each location in the city. The routing policy is broadcast to all of the vehicles in the VANET. We demonstrate through simulations on real traffic data that our algorithm outperforms an older algorithm GPSR and a recent Q-learning-based algorithm, QGrid G in terms of metrics like the delivery ratio and delay. We observe that the number of RSUs used by our algorithm is significantly lower than that of a recent algorithm, QTAR.
No takes yet. Share an insight, caveat, or question.
Boroujeni et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: