Scalable Travel Time reduction using Vehicular Communication in Urban Area

The car’s VANET networks which is a certain type of MANET networks is getting closer to everyday life, and actors such as car manufacturers, government organizations and academics are attracted to it. Mainly this area provides various application programs. And by providing connectivity to vehicles and the road side units (RSU) has affected many social and economic expectations. there’s been attempts to increase passenger safety and comfort for the users Using this Networks. But the implications go far beyond the networks between the car and its features can be used to solve the environmental and socio-economic disaster caused by traffic, such as traffic and air pollution and wasted citizens time and amount of fuel used. in this thesis, we investigate the trip time in three city`s map, london,paris and NY, in order to manage trafic problems and its arising problems .then we simulate different scenarios and analyse their performance by offering various solutions. In the first step, the Dijkstra’s algorithm is used for implementations as a measure to compare and evaluate the performance of the search algorithms, then the identification of factors affecting the travel time, and to determine the degree of importance of each of these factors, the analysis of data the car has been provided by networks and by extracting information about the factors that impact on travel time, A * algorithm is used to find the optimal path with shortest travel time possible. The simulation results also show a significant effect in reducing travel time is the preferred approach.