Proactive vs.

Reactive Routing

 Proactive Routing Protocol:

 continuously evaluate the routes
 attempt to maintain consistent, up-to-date routing
information
 when a route is needed, one may be ready immediately
 when the network topology changes
 the protocol responds by propagating updates throughout the
network to maintain a consistent view
 Reactive Routing Protocol:
 on-demand
 Ex: DSR, AODV

tseng:1
 Ad hoc routing protocols

AD-HOC MOBILE
ROUTING PROTOCOLS

TABLE DRIVEN/ ON-DEMAND-DRIVEN

PROACTIVE REACTIVE

DSDV HYBRID DSR

CGSR AODV

ZRP

tseng:2
 DSDV
 Destination Sequenced Distance Vector
 Table-driven
 Based on the distributed Bellman-Ford routing
algorithm
 Each node maintains a routing table
Routing hops to each destination
Sequence number

tseng:3
 DSDV
 Problem
A lot of control traffic in the network
 Solution
 two types of route update packets
Full dump
All available routing information
Incremental
Only information changed since the last full
dump

tseng:4
 Clustering Protocol
 Cluster Gateway Switch Routing (CGSR)
 Table-driven for inter-cluster routing
 Uses DSDV for intra-cluster routing

C2

C1

M2

tseng:5
C3
 AODV
 Ad hoc On-demand Distance Vector
 On-demand driven
 Nodes that are not on the selected path do not
maintain routing information
 Route discovery
The source node broadcasts a route request packet
(RREQ)
The destination or an intermediate node with “fresh
enough” route to the destination replies a route
reply packet (RREP)

tseng:6
 AODV

Destination
N2 N8
N5

Source N1 N7
N4
Destination
N2 N8
N3 N6 N5

(a) RREQ
Source N1 N7
N4

N3 N6

(b) RREP

tseng:7
 AODV
 Problem
 A node along the route moves
 Solution
 Upstream neighbor notices the move
 Propagates a link failure notification message
to each of its active upstream neighbors
 The source node receives the message and re-
initiate route discovery

tseng:8
 DSR
 Dynamic Source Routing
 On-demand driven
 Based on the concept of source routing
 Required to maintain route caches
 Two major phases
Route discovery
Route maintenance
A route error packet

tseng:9
 DSR

N1-N2
N1-N2-N5
N2 N8
N1 N5
N1-N3-N4 N1-N3-N4-N7

N1 N4 N7
N1-N3-N4
N1-N2-N5- N1-N2-N5-
N1 N1-N3 N8
N1-N3-N4-N6 N2 N8 N8
N5
N3 N1-N3-N4
N6 N1-N2-N5-
N8

N1 N7
N4

N3 N6

tseng:10
 ZRP
 Zone Routing Protocol
 Hybrid protocol
On-demand
Proactive
 ZRP has three sub-protocols
Intrazone Routing Protocol (IARP)
Interzone Routing Protocol (IERP)
Bordercast Resolution Protocol (BRP)

tseng:11
 Zone of Node Y

Border Node

Zone of Node Y

Bordercasting

Zone Radius =
Border Node
Node X r Hops

Node Z

Zone of Node X

Zone of Node Z
 LAR
 Location-Aided Routing
 Location information via GPS
 Shortcoming
GPS availability is not yet worldwide
Position information come with deviation

tseng:13
 LAR

Request Zone Expected Zone (Xd+R, Yd+R)

DEST
R

(Xd,Yd)

SRC
tseng:14
(Xs,Ys)
 DREAM
 Distance Routing effect Algorithm for
mobility
 Position-based
 Each node
maintains a position database
Regularly floods packets to update the position
Temporal resolution
Spatial resolution

tseng:15
 PAR
 Power-Aware Routing

N1 + N2 +
SRC – –
DES
T
+ +
– –

N3 + N4 +
– –
tseng:16