Dynamic p-graphs for predictions in vehicular networks

Vehicular cooperation aims to solve traffic issues and to improve road safety for vehicles and pedestrians. Such a cooperation is done through distributed algorithms that have to be executed in a topology-changing vehicular network. Ensuring the success of the cooperative strategies is of particular importance for ITS. We propose a method to predict the performances of such distributed algorithms regarding the traffic conditions.