CSE 6007 Mobile Ad Hoc Wireless Networks
Unit II Topic 8-15 Routing Protocols for Ad Hoc Wireless Networks
Department of Computer Science and Engineering
Kalasalingam University
1
Outline
Introduction
Topic 8 : Issues in Designing A Routing Protocol for Ad Hoc
Wireless Networks
Topic 9 : Classification of Routing Protocols
Topic 10 : Table Driven Routing Protocols
Topic 11 : On-Demand Routing Protocols
Topic 12 : Hybrid Routing Protocols
Topic 13 : Routing Protocols with Efficient Flooding Mechnisms
Topic 14 : Hierarchical Routing Protocol
Topic 15 : Power Aware Routing Protocol
2
3
4
The main routing
problems for MANETs 8
10
9
7
4
Node mobility
2
Routing path broken
frequently
3
1
6
7
8
9
10
11
12
13
14
15
16
Traditional ad-hoc routing protocols
18
19
20
21
22
Table-driven routing protocol – DSDV (cont.)
Example: Routing table for Node 1
15
Dest NextNode Dist seqNo
14
2 2 1 22
13 3 2 2 26
11 4 5 2 32
12
5 5 1 134
6 6 1 144
10 9
8 7 2 3 162
8 5 3 170
9 2 4 186
6
10 6 2 142
4
5
7 11 6 3 176
12 5 3 190
13 5 4 198
3 14 6 3 214
1
2 15 5 4 256
Table-driven routing protocol – DSDV (cont.)
Routing table for Node 1
15 Dest NextNode Dist seqNo
2 2 1 22
14
13
3 2 2 26
11 4 5 2 32
12
5 5 1 134
6 6 1 144
10
7 2 3 162
8 9
8 5 3 170
9 2 4 186
6
10 6 2 142
4 7
11 5 4 180
5
12 5 3 190
13 5 4 198
3 14 6 3 214
1
2 15 5 4 256
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
Route Discovery in DSR
Y
Z
S E
F
B
C M L
J
A G
H D
K
I N
Represents a node that has received RREQ for D from S
42
Route Discovery in DSR
Y
Broadcast
[S] Z
S E
F
B
C M L
J
A G
H D
K
I N
Represents transmission of RREQ
[X,Y] Represents route record stored in RREQ 43
Route Discovery in DSR
Y
Z
S [S,E]
E
[S,B] F
B
C M L
J
A [S,C] G
H D
K
I N
• Node H receives packet RREQ from two neighbors:
potential for collision
44
Route Discovery in DSR
Y
Z
S E
F [S,E,F]
B
[S,B,A] C M L
J
A [S,B,H] G
H D
[S,C,G] K
I N
• C receives RREQ from G and H, but does not forward
it again, because C has already forwarded RREQ once
45
Route Discovery in DSR
Y
Z
S E
F [S,E,F,J]
B
C M L
J
A G
H [S,B,H,I] D
K
I [S,C,G,K] N
J and K both broadcast RREQ to D
Their transmissions may collide at D
46
Route Discovery in DSR
Y
Z
S E
[S,E,F,J,M]
F
B
C M L
J
A G
H D
K
I N
D does not forward RREQ, because D is the intended target
47
Route Reply in DSR
Y
Z
S RREP [S,E,F,J,D]
E
F
B
C M L
J
A G
H D
K
I N
Represents RREP control message
48
An Example of Route Maintenance
Y
Route Error Packet : RERR
RERR [J-D] Z
S E
F
B
C M L
J
A G
H D
K
I N
J sends a route error to S along route J-F-E-S when it finds link [J-D] broken
Nodes hearing RERR update their route cache to remove all invalid routes
related with link J-D
49
Use of Route Caching
Can Speed up Route Discovery
[S,E,F,J,D]
[E,F,J,D]
S E [F,J,D],[F,E,S]
F [J,F,E,S]
B
C [G,C,S] M L
J
A [C,S] G
H D
[K,G,C,S] K
I RREP N
RREQ
Z
When node Z sends a route request for node C, node K sends back a
route
reply [Z,K,G,C] to node Z using a locally cached route
50
Use of Route Caching
Can Reduce Propagation of Route Requests
[S,E,F,J,D]
[E,F,J,D]
S E [F,J,D],[F,E,S]
F [J,F,E,S]
B
C [G,C,S] M L
J
A [C,S] G
[D,K,G,,C]
H D
[K,G,C,S] K
I RREP N
RREQ
Z
Route Replies (RREP) from node K and D limit flooding of RREQ.
51
52
53
54
55
56
Route Requests in AODV
Y
Z
S
E
F
B
C M L
J
A G
H D
K
I N
Represents a node that has received RREQ for D from S
57
Route Requests in AODV
Y
Broadcast transmission
Z
S E
F
B
C M L
J
A G
H D
K
I N
Represents transmission of RREQ
58
Route Requests in AODV
Y
Z
S E
F
B
C M L
J
A G
H D
K
I N
Represents links on Reverse Path
59
Reverse Path Setup in AODV
Y
Z
S E
F
B
C M L
J
A G
H D
K
I N
• Node C receives RREQ from G and H, but does not forward
it again, because node C has already forwarded RREQ once
60
Reverse Path Setup in AODV
Y
Z
S E
F
B
C M L
J
A G
H D
K
I N
61
Reverse Path Setup in AODV
Y
Z
S E
F
B
C M L
J
A G
H D
K
I N
• Node D does not forward RREQ, because node D
is the intended target of the RREQ
62
Forward Path Setup in AODV
Y
Z
S E
F
B
C M L
J
A G
H D
K
I N
Forward links are setup when RREP travels along
the reverse path
Represents a link on the forward path 63
Route Maintenance
3´
RERR RERR 3
1 2 D
S
The link from node 3 to D is broken as 3 has moved
away to a position 3´.
Node 2 sends a RERR message to 1 and 1 sends the
message in turn to S.
S initiates a route discovery if it still needs the route
to D.
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
