Vanets Routing paper Reading

1,A VANET Routing basedon the Rea l time Road Vehicle Density in the city environment, Hyun Yu, Joo n Yoo, Sanghyun Ahn. Icufn.

In this vanet routing protocol, each vehicle uses beacon information and road imformation table to calculate the real-time vehicle density information for a particular route. Based on real-time vehicle density information, each vehicle can establish a reliable route for packet delivery. Specifically, each vehicle periodically sends a beacons packet, and the beacons includes the direction in which it is moving, the number of vehicles that are moving in reverse (total numbers of reverse cars), its location, and its identifier. As a result, each vehicle will store the vehicle density information calculated from beacons in road information (RI). RI is created each time a new route is entered, and RI is updated when a new beacon is received. The TRC value is computed in such a way that: Trc=mc*rd/cd,MC is the value of the reversed car that has been counted, the Cd is the distance to move after entering a road, and Rd is the length of the road. Each time one receives beacon,reverse Cars field plus one. Therefore, the total vehicle density is DCN=RTRC + strc. The RTRC is the density of the vehicle in the opposite direction, and STRC is the TRC value in Beacon. In routing, it is primarily the request messages (RREQS) and Reply messages ((rreps) function. RReq messages have three domains, namely Roadlist, Roadhop, mindensity. The final destination compares routing results from different directions, choosing the Mindensity's largest route.

2, gspr-mv:a Routing Protocol Based on Motion vectors for Vanet,hongyu Tu, Lei Peng, Huiyun Li, Falin Liu. ICSP2014 proceedings.

On the basis of GPSR, some improvements have been made, mainly considering the fast moving characteristics of nodes and the efficiency of forwarding. In particular, depending on the location information of the vehicle, the speed of the node and the location of the future can be calculated. The author's idea is relatively simple and does not take into account factors such as the interaction between vehicles. First of all, according to the calculation of the speed and direction of the neighboring nodes, to exclude those and the car in the opposite direction of the car as a forwarding node of the possibility. Based on the speed of the vehicle and the direction of movement, predict the location of the future of their own and neighboring vehicles, screen out those nodes too far away from the destination. Finally, assuming that there are some nodes, and the distance from the source node is similar, it needs to compare speed to select the corresponding vehicle.

3, Directed information dissemination in VANET, A.K.M. Mahtab Hossain etc. Aintec ' one

The MPR algorithm is improved so that it can be applied to the identification of MPR nodes behind the vehicle (back MPR identification Alogorithm).

4, Routing in vehicular Ad Hoc networks:a Survey. Fan Li and Yu Wang. IEEE Vehicular Technology MAGAZINE | JUNE 2007
A survey about Routing in Vanets, it divides the work of Routing in Vanets into several categories: Ad Hoc Routing (AODV, DSR), position-based Routing, cluster-based Routing, broadcast Routing, Geocast Routing. Also, a table comparing the various routing protocols is given at the end of the paper.

5, an adaptive approach for information dissemination in vehicular Ad hoc Networks

This paper mainly introduces a method of non-centralized and adaptive information distribution. In addition, the paper also summarizes the information distribution protocol of broadcast class.

Vanets Routing paper Reading