ROUTING PROTOCOLS

1
 Characteristics of Routing Protocols

• It must be fully distributed

• It must be adaptive to frequent topology changes

• Route computation and maintenance must involve a minimum number of nodes

• It must be localized

• It must be loop-free and free from stale routes

• Number of packet collisions must be kept to a minimum

• It must converge to optimal routes with stable network topology

• It must optimally use scarce resources

• Every node in the network should try to store information

• It should be able to provide a certain level of quality of service 3

 Overview
Routing Information Update

Ad Hoc Routing Protocols

Proactive Reactive
Table-Driven Demand-Driven

DSDV WRP
AODV LMR DSR ABR
CGSR
TORA SSR

4
 Proactive vs Reactive
Proactive Reactive
Route from each node to every Routes from Source to Destination
other node in the network only

Routes are ready to use Routes constructed when needed,

instantaneously higher connection setup delay
Periodic route-update packets Route update when necessary

Large routing tables Small or No routing tables

5
 On-Demand Routing Protocols

Source Routing Hop-by-Hop Routing

ABR DSR
SSA AODV LMR LAR RDMAR

TORA

Elizabeth Royer and Chai Keong Toh, “A review of Current Routing Protocols for Ah Hoc Mobile Wireless Networks”, IEEE personal Communications April 1999 6
 Source Routing vs Hop-by-Hop Routing
Source Routing Hop-By-Hop Routing
Data packets carry the complete Data packets carry the address of
addresses from source to the destination and the next hop
destination
No routing table in intermediate All nodes maintain localized
nodes routing tables
Not Scalable Scalable

7
 General Properties
• Loop Free Routing
• Two Operation Phases
– Route Establishment
• Route Request  RouteRequest Packet, flooded by the Source
node
• Route Reply  RouteReply Packet, returned to source node by
Destination or Intermediate node
– Route Maintenance
• Route Reconstruction
• Route Deletion

8
 Protocols
• DSR: Dynamic Source Routing
• ABR: Associativity-Based Routing
• SSA: Signal Stability-Based Adaptive Routing Algorithm
• AODV: Ad Hoc On-Demand Distance Vector
• LAR : Location Aided Routing Protocol
• RDMAR: Relative Distance Micro-Discovery Ad Hoc Routing
• LMR: Light-weight Mobile Routing
• TORA: Temporally Ordered Routing Algorithm
• ARA: Ant-colony-based Routing Algorithm

9
 Dynamic Source Routing (DSR)
• Full source-route is aggregated in
RouteRequest, and sent back in RouteReply
• Each data packet carry the full address for all
nodes along the path
• Can store Multiple routes to destination
• Good for Small/ Low mobility networks

14
 DSR– Route Discovery
– Source Node broadcast RouteRequest packet
– Each Intermediate node do the following steps:
• If request received before  discard
• If node ID is listed in request  discard
• If Route to the destination is available send RouteReply to the source
node with full path
• Otherwise  append node ID and rebroadcast
– When destination is reached  return RouteReply with full path
– Intermediate nodes cache all paths they overhear
– Source node caches all paths received and choose Shortest Path

15
 DSR - Route Request

S-B
S-B-E
S E
B
D
S-B S-B-C
S C
S-A-G-F
S-B-C F
S
A
G S-A-G
S-A

RouteRequest Dropped

16
 DSR - Route Reply
B-E-D E-D
S-B-E-D
S-B-E-D
E
S-B-E-D B
D
S-B-E-D
S C
S-A-G-F-D
S-A-G-F-D
F
F-D
S-A-G-F-D
A
S-A-G-F-D
A-G-F-D G
S-A-G-F-D G-F-D

17
 DSR– Route Maintenance
– Triggered when a link breaks between two nodes along
the path from the Source to the destination
– Node who discover the break send a RouteError to inform
the source node about the broken link
– Source Node
• erase the route from the cache, and
• Use another cached routes, Or
• Request a new Route

18
 DSR – Route Maintenance

RouteError
E
RouteError B
D
S-B-E-D
S C
S-A-G-F-D
F

A
G

19
 DSR
• Promiscuous mode, intermediate nodes learns
about routes breaks
• During network partition, if the destination is
in different partition a backoff algorithm is
used to prevent frequent RouteRequest
broadcast

20
 DSR -- Concerns
• Scalability
• Large overhead in each data packet
• No Local repair of the broken link
• Stale cache information could result to
inconsistence during route reconstruction
• Poor Performance as Mobility increases

21
 Ad Hoc On-Demand Distance Vector
Routing (AODV)
• Source Routing (DSR, ABR and SSA) is good for
smaller networks due to large data packet overhead
• AODV:
– Hop by Hop basis
– No need to include the full path in the data packet
– Update Neighborhood information through periodic
beacons

22
 AODV– Route Discovery
– Source Node broadcast RouteRequest packet
– Each intermediate node gets a RouteRequest do the
following steps:
• Establish a reverse link to node it received the RouteRequest from
• If request received before  discard
• If route to destination is available and up-to-date  return
RouteReply using the reverse link
• Otherwise  rebroadcast the RouteRequest
– Destination node respond with RouteReply using the
reverse link

23
AODV - Route Discovery

E
B
D

S C

A
G

RouteRequest

24
AODV - Route Discovery

E
B
D

S C

A
G

Reverse Path Setup

RouteRequest

25
 AODV - Route Discovery

E
B
D

S C

A
G
RouteRequest Dropped
Reverse Path Setup
RouteRequest
26
 AODV - Route Discovery

E
B
D

S C

A
G
RouteReply
Reverse Path Setup
RouteRequest
27
 AODV - Route Discovery

E
B
D

S C

A
G

Forward Route Setup

RouteReply
Reverse Path Setup 28
 AODV - Route Discovery

E
B
D

S C

A
G

Forward Route Setup

RouteReply
Reverse Path Setup 29
 AODV - Route Discovery

E
B
D

S C

A
G

Forward Route Setup

RouteReply
Reverse Path Setup 30
 AODV – Route Maintenance
• When a node detects a link failure, it sends
special RouteReply with infinity distance
• RouteReply is propagated to source node
• Source node initiates a new RouteRequest

31
AODV – Route Maintenance

RouteReply
E
RouteReply B
D

S C

A
G

32
 AODV Concerns
• Route Reply from intermediate nodes can lead
to inconstant routes  Stale Cache
• Periodic beaconing cost

33