Zone Routing Protocol

Hybrid Protocol

ZRP exploits the features of both proactive

and reactive protocol.

The proactive part of the protocol is

restricted to a small neighbourhood of a
node and the reactive part is used for
routing across the network.

This reduces latency in route discovery and

reduces the number of control messages as
well.
Routing Zones
S
!
"
H
#
$
%
&
'
(
)
)ach node S in the network has a routing *one. This
is the proactive *one for S as S collects information
about its routing *one in the manner of the (S(+
protocol.
&asic Strategy in ZRP

The routing in ZRP is divided into two

parts
#ntra*one routing , -irst. the packet is sent
within the routing *one of the source node
to reach the peripheral nodes.
#nter*one routing , Then the packet is sent
from the peripheral nodes towards the
destination node.
S
(
intra*on
e
inter*one
/0
#ntra*one Routing

)ach node collects information about all

the nodes in its routing *one proactively.
This strategy is similar to a proactive
protocol like (S(+.

)ach node maintains a routing table for its

routing *one. so that it can 1nd a route to
any node in the routing *one from this
table.

)ach node periodically broadcasts a

message similar to a hello message known
as a *one noti1cation message.
Zone 2oti1cation 3essage
40

% hello message dies after one hop. i.e..

after reaching a node5s neighbours.

% *one noti1cation mesage dies after k

hops. i.e.. after reaching the node5s
neighbours at a distance of k hops.

)ach node receiving this message

decreases the hop count of the message by
6 and forwards the message to its
neighbours.
ZRP, )xample with
Zone Radius 7 K = 2
80
S
C
A
E
F
B
D
S performs route
discovery for D
Denotes route request
ZRP, )xample with ! = 2
90
S
C
A
E
F
B
D
S performs route
discovery for D
Denotes route reply
E knows route from E to D,
so route request need not be
forwarded to D from E
ZRP, )xample with K = 2
:0
S
C
A
E
F
B
D
S performs route
discovery for D
Denotes route taken by Data
#nter*one Routing
6;0

The inter*one routing discovers routes

to the destination reactively.

'onsider a source <S= and a

destination <(=. #f ( is within the
routing *one of S. the routing is
completed in the intra*one routing
phase.

>therwise. S sends the packet to the

peripheral nodes of its *one through
bordercasting.
#nter*one Route (iscovery
660

S sends a route re?uest <RR)@= message to

the peripheral nodes of its *one through
bordercasting.

)ach peripheral node P executes the same

algorithm.

-irst. P checks whether the destination ( is

within its routing *one and if so. sends the
packet to (.

>therwise. P sends the packet to the peripheral

nodes of its routing *one through bordercasting.
&ordercasting
6A0

The bordercasting to peripheral nodes

can be done mainly in two ways ,

&y maintaining a multicast tree for the

peripheral nodes. S is the root of this tree.

>therwise. S maintains complete routing

table for its *one and routes the packet to
the peripheral nodes by consulting this
routing table.
%n )xample of #nter*one Routing
6B0
S
(
&
H
%
'
Route Reply in #nter*one
Routing

#f a node P 1nds that the destination ( is

within its routing *one. P can initiate a route
reply.

)ach node appends its address to the RR)@

message during the route re?uest phase.
This is similar to route re?uest phase in (SR.

This accumulated address can be used to

send the route reply <RR)P= back to the
source node S.
6C
0
Route Reply in #nter*one
Routing

%n alternative strategy is to keep forward

and backward links at every node5s
routing table similar to the %>(+ protocol.
This helps in keeping the packet si*e
constant.

% RR)@ usually results in more than one

RR)P and ZRP keeps track of more than
one path between S and (. %n alternative
path is chosen in case one path is broken.
6/
0
Route 3aintenance

Dhen there is a broken link along an

active path between S and (. a local
path repair procedure is initiated.

% broken link is always within the

routing *one of some node.
64
0
S
(
Route 3aintenance

Hence. repairing a broken link re?uires

establishing a new path between two
nodes within a routing *one.

The repair is done by the starting node of

the link <node % in the previous diagram=
by sending a route repair message to node
& within its routing *one.

This is like a RR)@ message from % with &

as the destination.
68
0
How to Prevent -looding of
the 2etwork

#nter*one routing may generate many

copies of the same RR)@ message if not
directed correctly.

The RR)@ should be steered towards the

destination or towards previously
unexplored regions of the network.

>therwise. the same RR)@ message may

reach the same nodes many times.
causing the Eooding of the network.
69
0
Routing Zones >verlap
Heavily

Since each node has its own routing *one.

the routing *ones of neighbouring nodes
overlap heavily.

Since each peripheral node of a *one

forwards the RR)@ message. the message
can reach the same node multiple times
without proper control.

)ach node may forward the same RR)@

multiple times.
6:
0
"uiding the Search in
#nterZone Routing
A;
0
The search explores new regions of the network.
@uery -orwarding and
Termination Strategy

Dhen a node P receives a RR)@

message. P records the message in its list
of RR)@ messages that it has received.

#f P receives the same RR)@ more than

once. it does not forward the RR)@ the
second time onwards.

%lso P can keep track of passing RR)@

messages in several diFerent ways.
A60
Termination Strategies

#n the promiscuous mode of operation

according to #))) 9;A.66 standards. a node
can overhear passing traGc.

%lso. a node may act as a routing node during

bordercasting in the intra*one routing phase.

Dhenever P receives a RR)@ message

through any of these means. it remembers
which routing *one the message is meant for.
AA
0
)arly Termination of
Hnnecessary RR)@s
AB
0
P receives a RR)@ from @ since P is a peripheral node for the
routing *one of @.
P
@
%
&
'
2
I
P does not bordercast the RR)@ to %.&.....2 but only to I which is
not in its list.
Termination Strategies

Suppose P has a list of nodes %. &.'.....2

such that the RR)@ message has already
arrived in the routing *ones of the nodes %.
&. '. ....2.

2ow P receives a re?uest to forward a

RR)@ message from another node @.

This may happen when P is a peripheral

node for the routing *one of @.
AC
0
)valuation of ZRP

The optimal *one radius depends on node

mobility and route ?uery rates.

Dhen the radius of the routing *one is 6. the

behaviour of ZRP is like a pure reactive
protocol. for example. like (SR.

Dhen the radius of the routing *one is in1nity

<or the diameter of the network=. ZRP behaves
like a pure proactive protocol. for example. like
(S(+.
A/
0
'ontrol TraGc for #ntra*one
Routing

#n the intra*one routing. each node needs to

construct the bordercast tree for its *one.

Dith a *one radius of r. this re?uires

complete exchange of information over a
distance of ArJ6 hops.

-or unbounded networks with a uniform

distribution of nodes. this results in >< =
intra*one control traGc.
A4
0
2
r
'ontrol TraGc for #ntra*one
Routing

However. for a bounded network. the

dependence is lower than .

There is no intra*one control traGc when

r76.

The intra*one control traGc grows fast in

practice with increase in *one radius. So. it
is important to keep the *one radius small.
A8
0
2
r
'ontrol TraGc for #nter*one
Routing

Dhen the *one radius is 6. the control

traGc is maximum since ZRP degenerates
into Eood search.

#n other words. every RR)@ message

potentially Eoods the entire network. This
is due to the fact that all the neighbours of
a node n are its peripheral nodes.

However. control traGc drops considerably

even if the *one radius is Kust A.
A9
0
'ontrol TraGc for #nter*one
Routing

The control traGc can be reduced drastically

with early ?uery termination. when a RR)@
message is prevented from going to the same
region of the network multiple times.

However. the amount of control traGc depends

both on node mobility and ?uery rate.

The performance of ZRP is measured by

compairing control traGc with callJtoJmobility
<'3R= ratio.
A:
0
'ontrol TraGc for #nter*one
Routing

The callJtoJmobility ratio <'3R= is the ratio

of route ?uery rate to node speed.

%s '3R increases. the number of control

messages is reduced by increasing the
radius of the routing *ones.

This is because. it is easier to maintain

larger routing *ones if mobility is low.
Hence. route discovery traGc also reduces.
B;0
'ontrol TraGc for #nter*one
Routing

>n the other hand. '3R is low if mobility is

high.

#n such a case. the routing *one maintenance

becomes very costly and smaller routing
*ones are better for reducing control traGc.

%n optimally con1gured ZRP for a '3R of /;;

L?ueryMkmN produces 8;O less traGc than
Eood searching.
B6
0
Route @uery Response Time

-or a 1xed '3R. the route ?uery response

time decreases initially with increased *one
radius.

However. after a certain radius. the

response time increases with *one radius.

This is due to the fact that the network

takes longer time to settle even with small
changes in large routing *ones.
BA
0