Destination-Sequenced Distance Vector Routing
Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for ad hoc mobile networks based on the Bellman-Ford algorithm. It was developed by C. Perkins and P.Bhagwat in 1994. The main contribution of the algorithm was to solve the routing loop problem. Each entry in the routing table contains a sequence number, the sequence numbers are generally even if a link is present; else, an odd number is used. The number is generated by the destination, and the emitter needs to send out the next update with this number. Routing information is distributed between nodes by sending full dumps infrequently and smaller incremental updates more frequently.
For example the routing table of Node A in this network is
| Destination | Next Hop | Number of Hops | Sequence Number | Install Time |
|---|---|---|---|---|
| A | A | 0 | A 46 | 001000 |
| B | B | 1 | B 36 | 001200 |
| C | B | 2 | C 28 | 001500 |
Naturally the table contains description of all possible paths reachable by node A, along with the next hop, number of hops and sequence number.
Read more about Destination-Sequenced Distance Vector Routing: Selection of Route, Disadvantages, Influence
Famous quotes containing the word distance:
“I am considered a misanthropist now and then, because I do not socialize with many people. But it’s only my mind that avoids you, my heart is still with you, and seeks the distance so that it can keep on loving you.”
—Franz Grillparzer (1791–1872)