Gateways’ mobility increases the capacity of communication in VANETs: Routing algorithm based on congestion game

Vehicular Ad Hoc Network (VANET) is considered as a special application of Mobile Ad Hoc Networks in road traffic, which can autonomously organize networks without infrastructure. VANETs enable vehicles on the road to communicate with each other and with road infrastructure using wireless capabilities. In the last few years, extensive research provided several routing algorithms to extend Internet connectivity to VANETs through fixed gateways installed along the road. However, most of these algorithms have not been effective because of the high mobility of vehicles in the road. In this paper, we propose a routing algorithm which based both on the congestion game to resolve the problem of network congestion and on mobile gateways to resolve the problem of high mobility in VANET. Therefore, the proposed algorithm is a prediction done by each node in the network that helps them to reach the optimal route to access Internet. Simulation results validate the algorithm and show its robustness under two scenarios. In the first one, we examine the algorithm with fixed gateways installed along the road to validate the connectivity to the Internet. Whilst in the second scenario, we examine the algorithm with mobile gateways to show the effectiveness of gateways’ mobility on the capacity of communication and the Internet access in VANETs. © 2014 Praise Worthy Prize S.r.l. - All rights reserved.