Vehicular Reactive Routing protocol


Vehicular Reactive Routing protocol is a reactive routing protocol with geographical features which is specifically designed for Wireless Access for the Vehicular Environment standard in vehicular ad hoc networks. The protocol takes advantages of the multichannel scheme defined in WAVE and uses the Control Channel for signalling, and relies on one of the multiple Service Channels for payload data dissemination.

Protocol design

The Vehicular Reactive Routing protocol is integrated with the WAVE stack and is embedded at the Logic Link Control layer. VRR is a multi-channel protocol which exercises efficient route discovery, route maintenance and data deliver processes with the use of the Control Channel and a Service Channel. Standard WSA messages are transmitted over CCH and IPv6 packets are transmitted over SCH. To obtain a current neighbour location the WSA frame is modified to carry position information. Route request and route reply demands are transmitted inside WSA frames over the Control Channel and data acknowledgment and all application data are sent over the Service Channel.
Due to these modifications, a route is firstly established over the CCH and afterwards data are transmitted over the SCH.

VRR protocol messages

The VRR protocol uses 3 signalling message types. Messages, route request and route reply are broadcast on the CCH and acknowledgment packets are transmitted on the SCH. Data packets are IPv6 packets and are transmitted after route discovery or route maintenance on one of SCHs. RREQ and RREP are situated inside the WRA field of WSA frame and on each hop the WSA frame is discarded and a new WSA frame created. Both messages are transmitted in the lowest Traffic Class.

VRR Broadcasting

This algorithm is based on combination of three approaches
  • Neighbour elimination family: receiving nodes themselves decide to rebroadcast data or not on base of network coverage. If all nodes in transmit range of receiver node are covered by the information, then the receiver node does not rebroadcast. If some node is not covered by the information in transmit range of the node then the node prepares data to rebroadcast.
  • Source-dependent dominating sets: The principle is that a sender determines for a small subset of neighbours which is called multipoint relay. Only nodes inside the subset can rebroadcast information from the source.
  • Probability: where probability depending on the distance between a transmitter and a receiver. A Higher probability is chosen for node further from a source and vice versa with a lower probability for closer nodes.
Principle of VRR Broadcasting simply like that:
A transmitter sends a broadcast data.
  • If receiving node is chosen as MPR node by transmitter, it sets up shortest backoff time.
  • If receiving node is not chosen as MPR node by transmitter, it sets up backoff time depend on its mobility behaviour.
  • If receiving node calculates that its neighbour's nodes are already covered by broadcast information, then the node doesn't rebroadcast.
An advantage of VRR Broadcasting approach is that all receiving nodes have some opportunity to rebroadcast information, but only a few nodes have the best opportunity for rebroadcasting. Another advantage is that in the case of the multipoint relay node not always receiving the broadcast due to collisions then other nodes who overhear can transmit the information instead.

Route discovery technique

The RREQ frames are broadcast by the VRR Broadcasting algorithm. If a node doesn't have a route to destination then the node rebroadcasts depend on the algorithm. If a node has a route to destination, it creates broadcast frame RREP and set up backoff time depend on mobility behaviour. If a RREP is transmitted by a transmitter, all neighbour's nodes received also the RREP and they discards own RREQ or RREP effort except node which is on a way to a source node.