Vehicular Reactive Routing protocol: Difference between revisions

Revision as of 09:11, 31 October 2008

Latest revision as of 18:21, 19 July 2025

(17 intermediate revisions by 13 users not shown)

Line 1:

{{Distinguish|Virtual Router Redundancy Protocol}}

'''Vehicular Reactive Routing protocol (VRR)'''<ref>{{Citation

{{Multiple issues|

{{More citations needed|date=July 2025}}

{{Notability|date=July 2025}}

}}

'''Vehicular Reactive Routing protocol''' ('''VRR)''')<ref>{{Citation

| last1 = Koubek| first1 = Martin

| author1-link =

Line 6 ⟶ 11:

| last3 = Pesch| first3 = Dirk

| author3-link =

| title chapter= A Novel Reactive Routing Protocol for Applications in Vehicular Environments

| journal title= The 11th International Symposium on Wireless Personal Multimedia Communications (WPMC 2008)

| ___location = Finland

| date = [[2008-09-11]]

| issn = 1883-1192 }}</ref> is a reactive routing protocol with geographical features which is specifically designed for [[Wireless Access infor the Vehicular EnvironmentsEnvironment]] (WAVE) systemstandard in [[Vehicularvehicular ad-hoc Network|Vehicular ad-hoc Networksnetwork]]s ([[VANET|VANETs]]). The protocol takes advantages of the multichannel scheme defined in WAVE and uses the Control Channel (CCH) for signalling, and relies on one of the multiple Service Channels (SCHs) for payload data dissemination.

| year = 2008

| issn = 1883-1192 }}</ref> is a reactive routing protocol with geographical features which is specifically designed for [[Wireless Access in Vehicular Environments]] (WAVE) system in [[Vehicular ad-hoc Network|Vehicular ad-hoc Networks]] ([[VANET|VANETs]]). The protocol takes advantages of the multichannel scheme defined in WAVE and uses the Control Channel (CCH) for signalling, and relies on one of the multiple Service Channels (SCHs) for payload data dissemination.

==Protocol design==

[[Image:VRR_stackVRR stack.png|thumb|frame|right|Stack of WAVE with VRR]]

The Vehicular Reactive Routing (VRR) 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 (CCH) and a Service Channel (SCH). 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 (incurs an additional 4 Bytes). Route request and route reply demands are transmitted inside WSA frames (additional 40 Bytes) over the Control Channel and data acknowledgment and all application data (IPv6 packets) 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 Protocolprotocol Messagesmessages==

The VRR protocol uses 3 signalling message types. Messages, route request (RREQ) and route reply (RREP) are broadcastedbroadcast on the CCH and acknowledgment (ACK) 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 (background).

==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 (MPR). 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 (waiting time before rebroadcasting).

* If receiving node is not chosen as MPR node by transmitter, it sets up backoff time depend on its mobility behaviour (distance from a transmitter, speed and vector of motion).

* If receiving node calculates that its neighbour's nodes are already covered by broadcastedbroadcast information, then the node doesn't rebroadcast.

An advantage of VRR Broadcasting approach is that all receiving nodes have some opportunity to rebroadcast information (not only MPR nodes), but only a few nodes have the best opportunity (i.e. the shortest backoff time) for rebroadcasting. Another advantage is that in the case of the multipoint relay node not always receiving the broadcast due to collisions (in a dense busy network) then other nodes who overhear can transmit the information instead.

==Route discovery technique==

The RREQ frames are broadcastedbroadcast 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 (distance from a transmitter, speed and vector of motion). 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.

[http://martinkoubek.czweb.org/conference/WPMC_08_files/finland/wpmc_highway.swf Principle of VRR Route Discovery handshake (without MPRs) (animation)]

==ReferenceReferences==

{{Reflist}}

[[Category:Routing protocols]]

[[Category:Ad_hoc_routing_protocolsAd hoc routing protocols]]

[[Category:Routing algorithms]]

[[Category:Routing protocols]]