DSDV

Destination Sequenced Distance Vector Protocol

Seminar presentation for PG MANET-WLAN December 2, 2003

Felix Peter, Dec. 2, 2003

Classification of Routing Protocols for MANETS

Unicast-Routing Protocol for MANET (Topology-based)

Table-Driven/ Proactive DistanceVector

DSDV

Hybrid

On-Demanddriven/Reactive
DSR AODV TORA

Clusterbased/ Hierarchical
LANMAR CEDAR

LinkState
OLSR TBRPF FSR STAR

ZRP

MANET: Mobile Ad hoc Network (IETF working group)

2

Felix Peter, Dec. 2, 2003

Ad-hoc Networks
Ad-hoc network:
A collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration.

Significant differences to existing wired networks:

Wireless Self-starting No administrator Cannot assume, that every computer is within communication range of every other computer Possibly quite dynamic topology of interconnections

Felix Peter, Dec. 2, 2003

Distance-Vector routing
Each node maintains a routing table containing
list of all available destinations number distance to each each destination next hop to reach a destination

The succession of next hops leads to a destination Each node periodically broadcasts its current estimate of the shortest distance to each available destination to all of its neighbors Typical representative: Distributed Bellman-Ford (DBF)

Felix Peter, Dec. 2, 2003

Bellman-Ford Algorithm

Bellmann-Ford (G,w,s) Initialize-Single-Source (G,s) for i 1 to |V[G]|-1 do for each edge (u,v) E[G] do Relax (u,v,w) for each edge (u,v) E[G] do if d[v] > d[u]+w(u,v) then return FALSE return TRUE
Felix Peter, Dec. 2, 2003 5

Initialize-Single-Source & Relax

Initialize Single Source (G,s) for each vertex vV[G] do d[v] [v] NIL d[s] 0

Relax (u,v,w) if d[v] > d[u] + w(u,v) then d[v] d[u] + w(u,v) [v] u

Felix Peter, Dec. 2, 2003

Bellman-Ford Algorithm

Felix Peter, Dec. 2, 2003

Bellman-Ford Routing
Computationally efficient Easy to implement Problem: Can cause loops Problem: Counting to infintiy Modifications elminate the problem of loops but need some internodal coordination mechanisms which imply few topological changes Not designed to handle rapid topological changes

Felix Peter, Dec. 2, 2003

DSDV
Design goals:
Keep the simplicity of Bellman-Ford Avoid the looping problem Remain compatible in cases where a base station is available

Idea: modify the conventional Bellman-Ford routing algorithm Approach:

Model each host as a router Tag each routing table entry with a sequence number
Felix Peter, Dec. 2, 2003 9

The Routing Table

All available destinations Next hop for each destination Number of hops to each available destination A sequence number for each route table entry, originated by the destination station
Destination A B C D Next Hop A B B B Metric Seq. No Install Time 0 1 3 4 A-846 B-470 C-920 D-502 001000 001200 001500 001200 Stable Data Ptr_A Ptr_B Ptr_C Ptr_D

Felix Peter, Dec. 2, 2003

10

Transmitting Route Information

Routing information is transmitted by broadcast Updates are transmitted periodically or immediately when any significant topology change is available
Sequence numbers are assigned by destination (even numbers) If a broken link is detected: metric and updated odd sequence number are assigned by detecting host

Full dump: all information from the transmitting node Incremental dump: all information that has changed since the last full dump Full dump if incremental dump exceeds one NPDU (network protocol data unit)

Felix Peter, Dec. 2, 2003

11

Selection of Routes
If new routing information is received Any route with a more recent sequence number is used If the new route has equal seqence number but better metric, this route is chosen Newly recorded routes are scheduled for immediate advertisement

Felix Peter, Dec. 2, 2003

12

Receiving Fluctuating Routes

MH9

What might happen: 1) MH9 broadcasts update information to MH Collections I and II

Mobile Host Collection I

Mobile Host Collection II

2) MH2 transmits new routing information to MH4

3) MH4: new sequence number routing table update broadcast update

4) MH6 transmits new routing information to MH4, same sequence number, better metric 5) MH4: same seq.no., better metric update routing table broadcast update
13

MH2

MH6

MH4

Felix Peter, Dec. 2, 2003

Damping Fluctuation
Causes for Fluctuation:
Many hosts with irregular updates Different propagation speed Different transmission intervals Broadcasts are asynchronous events

Solution: Keep a route settling time table in each node with a time to wait for a route with a better metric before advertising the update message. Settling time: Calculated by maintaining a running weighted average over the most recent updates of the routes for each destination.

Felix Peter, Dec. 2, 2003

14

Stale Entries

Stale entries are defined to be entries that have not been updated the last few update periods

Stale entries are deleted at the same time when routing updates are applied to the routing table
Any route using that host as a next hop is deleted, included the route indicating that host as the actual destination

Felix Peter, Dec. 2, 2003

15

Example of DSDV in operation

MH3

MH4

MH5

MH2

MH6 MH7

MH8

MH1

Felix Peter, Dec. 2, 2003

16

Example of DSDV in operation

MH3 MH4 MH5

MH2

MH6

MH8

MH1
Destination Next Hop

MH7
Metric 0 2 1 2 2 1 2 3 Seq. No

MH4 advertised table:

Felix Peter, Dec. 2, 2003

MH4 MH1 MH2 MH3 MH5 MH6 MH7 MH8

MH4 MH2 MH2 MH2 MH6 MH6 MH6 MH6

S406_MH4 S128_MH1 S564_MH2 S710_MH3 S392_MH5 S076_MH6 S128_MH7 S050_MH8

17

Example of DSDV in operation

MH3 MH4 MH5

MH2

MH6

MH8

MH1

MH7

MH1

1) Update triggered by MH1 , broadcasted to MH7 and MH8 2) On detection of broken link: Immediate incremental update triggered by MH2 with odd sequence number and infinite metric 3) Updates are propagated through the network

Felix Peter, Dec. 2, 2003

18

Example of DSDV in operation

MH3 MH4 MH5

MH2

MH6

MH8

MH7
Destination Next Hop Metric 0 3 1 2 2 1 2 3

MH1
Seq. No

MH4 advertised table (updated):

Felix Peter, Dec. 2, 2003

MH4 MH1 MH2 MH3 MH5 MH6 MH7 MH8

MH4 MH2 MH2 MH2 MH6 MH6 MH6 MH6

S516_MH4 S238_MH1 S674_MH2 S820_MH3 S502_MH5 S186_MH6 S238_MH7 S160_MH8

19

Evaluation of DSDV: Performance

Each node maintains two tables The need of bandwidth and the size of tables grow simultaneously with mobility and number of nodes overhead for maintaining and updating tables will increase heavy routing overhead will degrade the performance of the network

Felix Peter, Dec. 2, 2003

20

Simulation results
Simulation by Broch, Maltz, Johnson, Hu, Jetcheva DSDV fails to converge if nodes dont pause for at least 300 seconds Packet delivery ratio is in the range of 70%-92% at higher rate of mobility Packet loss is mainly caused by stale routing entries Routing overhead is approximately constant, regardless of movement rate or traffic load Nearly optimal path can be selected in routing procedure

Felix Peter, Dec. 2, 2003

21

Stability and Scalability

DSDV requires a full dump update periodically DSDV is not efficient in route updating DSDV limits the number of nodes that can join the network Whenever topology of a network changes, DSDV is unstable until update packets propagate through the network

Felix Peter, Dec. 2, 2003

22

Conclusion
DSDV is effective for creating ad-hoc networks for small populations of mobile nodes DSDV is a fairly brute force approach, because connectivity information needs periodical update througout the whole network

Felix Peter, Dec. 2, 2003

23

Current Status
DSDV is a well-known routing algorithm for ad hoc network routing No standard specifications or commercial implementations available Many improved protocols based on DSDV have been developed Example: AODV: Ad-hoc On-Demand Distance Vector Routing

Felix Peter, Dec. 2, 2003

24

AODV
AODV is based on the DSDV algorithm
Distance vector Sequence numbers

Creation of routes on a demand basis Nodes that are not on a selected path do not maintain routing information or participate in routing table exchanges! Goal: Minimize broadcast overhead and transmission latency

Felix Peter, Dec. 2, 2003

25

AODV

Unicast-Routing Protocol for MANET (Topology-based)

Table-Driven/ Proactive DistanceVector

DSDV

Hybrid

On-Demand driven/Reactive
DSR AODV TORA

Clusterbased/ Hierarchical
LANMAR CEDAR

LinkState
OLSR TBRPF FSR STAR

ZRP

MANET: Mobile Ad hoc Network (IETF working group)

26

Felix Peter, Dec. 2, 2003

AODV
Path discovery Process:
Source node initiates path discovery process by broadcasting RREQ Neighbors forward RREQ RREQ is forwarded until either destination or intermediate node with a fresh enough route to it is located Destination or intermediate node responds by unicasting RREP along the reverse path

Local connectivity checked on a regular basis by listening to retransmission or sending hello messages Link failure:
Failure notification message (RREP with infinite metric) is passed upstream to the source, erasing that part of the route
Felix Peter, Dec. 2, 2003 27

AODV: Simulation results

Simulation by Broch, Maltz, Johnson, Hu, Jetcheva Implementation without Hello mechanism Delivery of over 95% regardless of mobility rate Routing overhead drops as mobility rate drops Not optimal path, up to 4 or more hops longer paths Requires up to 5 times the overhead of DSR

Felix Peter, Dec. 2, 2003

28

Comparison: DSDV and AODV

DSDV:
Table driven, proactive Best performance when node mobility rate and movement speed are low Approximately constant overhead, regardless of movement rate or traffic load

AODV:
On demand Good performance at all mobility rates Still requires transmission of many routing overhead packets

Felix Peter, Dec. 2, 2003

29

References
Charles E. Perkins and P. Bhagwat, Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for Mobile Computers, ACM SIGCOMM94, 1994 Guoyou He, Destination-Sequenced Distance Vector (DSDV) Protocol Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu, Jorjeta Jetcheva, A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols, MobiCom98, 1998 Charles E. Perkins, Elizabeth M. Royer, Ad-hoc On-Demand Distance Vector Routing, 1999 Elizabeth M. Royer, Chai-Keong Toh, A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks, IEEE Personal Communications, April 1999 Andrew S. Tanenbaum, Computer Networks, 3rd Edition, Prentice Hall, 1996 T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, 1990
Felix Peter, Dec. 2, 2003 30