* Destination sequenced
distance vector [DSDV]: The DSDV is table driven based routing algorithm.
DSDV is improved version of Bellman Ford routing algorithm.
* Each DSDV node maintain two
routing tables: - table for forwarding packets, and table for advertising
incremental updates. The nodes will maintain a routing table that consists of a
sequence number. The routing table periodically exchanged so that every node
will have latest information.
* DSDV is suitable for small
networks.
The algorithm
works as follows
* A node or a mobile device will
make an update in its routing table and send the information to its neighbor
upon receiving the updated information and make an update in its own routing
table.
* The update is made by comparing
the sequence number received is greater than present sequence number than the
new one will be used.
* If there is a link failure in
one of the node will change the metric value to infinity and broadcast the
message.
0 comments