Route Optimization for GPSR in VANET

In this paper, we try to proposal a new mechanism for optimizing the route of the Greedy parts of GPSR. By studying the GPSR, we find that the Greedy part of GPSR is not always to find the most optimized route, especially in the denser scenario. So according to this problem, we try to propose a mechanism to find an optimized route. In our proposal, we give out a formula to compute a unique value for each of neighbors. The one with the smallest value will be chosen as the next forwarding hop. The main advantage of our mechanism is that it integrates the influence of both of the denser and sparse environment. Therefore, wherever we located, we can always find an optimized route comparing with GPSR. In this paper, we also give out a mathematical model to evaluate the performance of our proposal. Basing on the model, we use ns to simulate the highway condition. Form the result, we find that our proposal is better that GPSR at aspect of time delay. But in the packet delivery ratio, it doesn't bring us a remarkable improvement. In the following part, I will describe them in detail.