Académique Documents
Professionnel Documents
Culture Documents
DSDV
DSR, AODV
ZRP, CEDAR
6. Other approaches
Geographical routing
AdHoc-1
Fixed network
S-38.121 / S-04 / N Beijar
Radio coverage
of node A
AdHoc-3
Ad Hoc Networks
Characteristics
Dynamic topology
Links are low bandwidth, variable capacity, sometimes unidirectional
Limited battery power and other resources in the nodes
More route alternatives (every node is a router)
Typical applications
AdHoc-4
No physical links
Wireless links created and
destroyed as nodes move
Frequent disconnections and
partitions
AdHoc-5
Each node knows the routes to all other nodes in the network
Problems in Ad-Hoc networks
Maintenance of routing tables requires much bandwidth
Dynamic topology much of the routing information is never used
Waste of capacity
Flat topology
No aggregation
AdHoc-6
Reactive routing
In reactive routing the routes are created when needed
Before a packet is sent, a route discovery is performed
The results are stored in a cache
When intermediate nodes move, a route repair is required
Advantages
Only required routes are maintained
Disadvantages
Delay before the first packet can be sent
Route discovery usually involves flooding
AdHoc-7
Standardization in IETF
MANET (Mobile Ad hoc Network) working group
Currently considered routing protocols: DSR, AODV, OLSR, TBRPF
MobileIP
S-38.121 / S-04 / N Beijar
AdHoc-8
AdHoc-9
AdHoc-10
Bandwidth consuming
Count-to-infinity problem
AdHoc-11
AdHoc-12
message is delayed
D
A
E
F
C
D
A
node A moves A
sequence
F
number n+1
sequence
number n
AdHoc-14
AdHoc-15
AdHoc-16
AdHoc-17
[S]
[S]
[S]
AdHoc-18
[S,A]
[S,A]
[S,F]
[S,F]
AdHoc-19
[S,A,B]
B
C
[S,F,K]
G
[S,F,G]
S-38.121 / S-04 / N Beijar
AdHoc-20
B
C
I
H
[S,A,B,C]
[S,F,G,H]
AdHoc-21
B
C
[S,A,B,C,D]
AdHoc-22
The source node also learns the routes to the intermediate nodes
S also learns route to A, B and C
Data [S,A,B,C,D]
B
C
K
G
H
AdHoc-23
DSR Properties
Advantages
Only the communicating nodes need to maintain the route
Several alternative routes to the destination
Intermediate nodes can reply to requests using their cache
Problems
Long routes Long packets
(Large overhead in e.g. small voice packets)
AdHoc-24
B
C
K
G
I
H
Destination
Next hop
Routing table of B
AdHoc-25
AdHoc-26
Route requests
A node sends a route request when it needs a route to a destination
and does not have one
Destination number in RREQ is the last known number for the
destination (may be unknown)
Expanding ring search
Waiting packets are queued during the route request
Intermediate nodes
Discards duplicate requests
Creates an entry towards the requester (sequence number from RREQ)
Used for reply
AdHoc-28
Route replies
If the destination replies
The sequence number is first incremented if it is equal to the number in the
request
RREP contains the current sequence number, hop count = 0, full lifetime
(this is simplified)
AdHoc-30
Non-uniform protocols
Zone Routing Protocol (ZRP)
Clustering routing protocols
AdHoc-31
Non-uniform protocols
2. Partitioning
Peripheral nodes
with minimum
distance
H
G
AdHoc-34
K
F
P
O
AdHoc-35
H
G
K
F
I
N
P
Q
L
V
O
R
AdHoc-36
H
G
K
F
P
O
AdHoc-37
H
G
K
F
I
N
P
Q
L
V
O
R
AdHoc-38
H
G
K
F
I
N
P
Q
L
V
O
R
AdHoc-39
Cluster
Backbone link
S-38.121 / S-04 / N Beijar
AdHoc-40
AdHoc-41
Reactive
GSR
DSR
Non-uniform
Destination-based
Proactive
DSDV
WRP
Reactive
Neighbor selection
ZRP
OLSR
Partioning
CEDAR
CBRP
AODV
TORA
ABR
AdHoc-42
AdHoc-43
Location service
Location updates
AdHoc-44