Efficient Routing Scheme Using Circular Node for VANET

It is possible to provide applications for life-saving and traffic control on VANET in which characteristic of high mobility and extreme topology changes is shown. And greedy-forwarding strategy that is one of the position-based routing schemes cause inefficient path forwarding and frequent transmission failure. Thus, we propose efficient routing scheme using circular node to provide service registration and request on VANET. The circular nodes which maintain regular route collect messages from immediate nodes in the coverage and determine optimized path to the destination using Dijkstra algorithm setting some of the other circular nodes as anchor points which ensure reliable routing path. Also, data transmission rate between each intersection of circular node route is periodically measured and updated for routing path determination to consider variable road condition. We evaluate our scheme that is enhanced using circular node as anchor-points comparing GPSR greedy forwarding in transmission delay measurement.