DSDV
Destination-Sequenced Distance-Vector
Routing Protocol
Outline
n Introduction
n Distance-Vector
n DSDV Protocol
n Summary
Introduction
n The property of ad-hoc networks
n Topology may be quite dynamic
n No administrative host
n Hosts with finite power
Introduction
n The properties of the ad-hoc network routing
protocol
n Simple
n Less storage space
n Loop free
n Short control message (Low overhead)
n Less power consumption
n Multiple disjoint routes
n Fast rerouting mechanism
Introduction
n Routing Protocol:
n Table-driven (proactive)
n Source-initiated on-demand (reactive)
n Hybrid
n Routing Algorithm
n Link-State algorithm:
n Each node maintains a view of the network topology
n Distance-Vector algorithm:
n Every node maintains the distance of each destination