E车载自组网(VANET).ppt

The scheme presented in the paper also reduces the overall traffic in highly mobile VANET networks. The frequency of flood requests is reduced by elongating the link duration of the selected paths. To prevent broadcast storms that may be intrigued during the path discovery operation, another scheme is also introduced. The basic concept behind the proposed scheme is to broadcast only specific and well-defined packets, referred to as “best packets” in the paper. * The key idea behind the scheme is to group vehicles according to their velocity headings. This kind of grouping ensures that vehicles that belong to the same group are generally moving together. Routes, involving vehicles from the same group, exhibit thus high level of stability. Among these possible routes, communication is set up on the most stable route using the Receive on Most Stable Group-Path (ROMSGP) scheme. Decision of the most stable link is made based on computation of the Link Expiration Time (LET) of each path. Obviously, the path with the longest LET is considered as the most stable link. * * Fig depicts the scenario of five vehicles at an intersection where vehicle B is turning onto a new street and the other four vehicles are continuing straight on the same road. A connection is established between vehicles A and F. Communication is possible on two routes: one via vehicle B (route A-B-D-F) and the other via vehicle C (route A-CDF). As vehicle B is turning left and vehicle A is continuing straight, the former route is more likely to be ruptured after a certain time. Consequently, the selection of the latter router is a more appropriate choice and has tendency to add more stability and reliability to the communication path between the two vehicles (A and F). * * Considering the scenario in figure, let λ as the metric penalty. Assume that no routing metric penalties, all routing metrics equal to one. In such case, both routes ABD and ACD have the same probability of been chosen as route. But i