Congestion Control in a Location Service for VANETs

摘要

Vehicular ad-hoc networks are self-organized networks to provide communication between the vehicles. It is challenging to determine a routing protocol for the communication between the vehicles since the vehicles are moving in different speeds and directions, which causes a rapidly changing network topology. Other approaches in literature assign traffic to the best available path, possibly causing congestion in the network. In this paper, we determine the optimal route of intersections based on a penalty function to obtain load balancing in the network.