PRESENTED BY: MCA 5TH SEM
D - Destination S - Sequenced D - Distance V - Vector
Collection of mobile nodes forming a temporary network Network topology changes frequently and unpredictably
Proactive: Each node maintains routing information for all known destinations, which is updated periodically Tables need to be consistent and up-to-date view of the network Updates propagate through the network
Basic Routing Protocol Based on Bellman ford routing algorithm with some improvement Each node maintains a list of all destinations and number of hops to each destination Each entry is marked with a sequence number
1
Dest. A B C
B
Nex Metric t A 1 B 0 C 2
2
Seq A-550 B-100 C-588
C
Dest. Next Metric Seq. A B 1 A-550 B B 2 B-100 C C 0 C-588
Dest. Next Metric Seq A A 0 A-550 B B 1 B-100 C B 3 C-586
Advertise to each neighbor own routing information Destination Address Metric = Number of Hops to Destination Destination Sequence Number Rules to set sequence number information On each advertisement increase own destination sequence number (use only even numbers) If a node is no more reachable, increase sequence number of this node by 1 (odd sequence number) and set metric = .
Update information is compared to own routing table 1. Select route with higher destination sequence number (This ensures to use always newest information from destination)
2. Select the route with better metric when sequence numbers are equal.
B increases Seq.Nr from 100 -> 102 B broadcasts routing information to Neighbors A, C including destination sequence numbers
(A, 1, A-550) (B, 0, B-102) (C, 1, C-588)
(A, 1, A-550) (B, 0, B-102) (C, 1, C-588)
C
Dest. Next Metric Seq. A B 2 A-550 B B 1 B-102 C C 0 C-588
Dest. Next Metric Seq A A 0 A-550 B B 1 B-102 C B 2 C-588
Dest. Next Metric Seq A A 1 A-550 B B 0 B-102 C C 1 C-588
Routing table updates are periodically transmitted or as needed throughout the network in order to maintain consistency. To reduce the routing update overhead, employ two types of techniques.
full dump This type of packet carries all available routing information and can require multiple network protocol data units (NPDUs). During periods of occasional movement, these packets transmitted infrequently. incremental Fitted into a standard NPDU. Being used to relay only that information which has changed since last full dump.
2. Insert entry for D with sequence number D-000 Then immediately broadcast own table
1. D broadcast for first time Send Sequence number D000 (D, 0, D-000)
A
Dest. Next Metric A A 0 B B 1 C B 2 Seq. A-550 B-104 C-590
B
Dest. Next Metric Seq. A A 1 A-550 B B 0 B-104 C C 1 C-590
C
Dest. Next Metric A B 2 B B 1 C C 0 D D 1 Seq. A-550 B-104 C-590 D-000
4. B gets this new information and updates its table.
3. C increases its sequence number to C-592 then broadcasts its new table.
(A, 2, A-550) (B, 1, B-102) (C, 0, C-592) (D, 1, D-000)
(A, 2, A-550) (B, 1, B-102) (C, 0, C-592) (D, 1, D-000)
A
Dest. Next Metric Seq. A A 0 A-550 B B 1 B-104 C B 2 C-590
B
Dest. Next Metric Seq. A A 1 A-550 B B 0 B-102 C C 1 C-592 D C 2 D-000
C
Dest. Next Metric A B 2 B B 1 C C 0 D D 1 Seq. A-550 B-102 C-592 D-000
2. B does its broadcast -> no affect on C (C knows that B
has stale information because C has higher seq. number for destination D)
-> no loop -> no count to infinity
1. Node C detects broken Link: -> Increase Seq. Nr. by 1
(only case where not the destination sets the sequence number -> odd number)
(D, 2, D-100)
(D, 2, D-100)
A
Dest. Next Metric Seq. D B 3 D-100
B
Dest.c Next Metric Seq. D C 2 D-100
C
Dest. Next Metric Seq. D D D-101
3. Immediate propagation B to A:
(update information has higher Seq. Nr. -> replace table entry)
2. Immediate propagation C to B:
(update information has higher Seq. Nr. -> replace table entry)
1. Node C detects broken Link: -> Increase Seq. Nr. by 1
(only case where not the destination sets the sequence number -> odd number)
(D, , D-101)
(D, , D-101)
A
Dest. Next Metric Seq. ... D B 4 D-100 3
B
Dest.c Next Metric Seq. ... 2 C D 3 D-100
C
Dest. Next Metric Seq. 1 D B D-100 D
D-101
D-101
D-101
DSDV is an efficient protocol for route discovery. Whenever a route to a new destination is required, it already exists at the source. Hence, latency for route discovery is very low.
DSDV also guarantees loop-free paths.
However, DSDV needs to send a lot of control messages. These messages are important for maintaining the network topology at each node. This may generate high volume of traffic for highdensity mobile networks.
Questions ?
