Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Mobile Computing - DSDV -, Study notes of Mobile Computing

This document about DSDV - Destination-Sequenced Distance Vector Algorithm, DSDV, DSDV Advantages, DSDV Disadvantages, Periodic updates, Routing .

Typology: Study notes

2010/2011

Uploaded on 09/04/2011

amit-mohta
amit-mohta 🇮🇳

4.2

(152)

89 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
DSDV - Destination-Sequenced
Distance Vector Algorithm
By Perkins and Bhagvat
Routes are broadcasted from the “receiver
Nodes announce their presence: advertisements
Each broadcast has
Destination address: originator
No of hops
Sequence number of broadcast
The route with the most recent sequence is used
Based on Bellman Ford algorithm
Exchange of routing tables
Routing table: the way to the destination, cost
Each node advertises its position
Sequence number to avoid loops
Maintain fresh routes
pf3
pf4
pf5

Partial preview of the text

Download Mobile Computing - DSDV - and more Study notes Mobile Computing in PDF only on Docsity!

DSDV - Destination-Sequenced

Distance Vector Algorithm

  • (^) By Perkins and Bhagvat
  • (^) Routes are broadcasted from the “receiver”
    • (^) Nodes announce their presence: advertisements
  • (^) Each broadcast has
    • (^) Destination address: originator
    • (^) No of hops
    • (^) Sequence number of broadcast
  • (^) The route with the most recent sequence is used
  • (^) Based on Bellman Ford algorithm
    • (^) Exchange of routing tables
    • (^) Routing table: the way to the destination, cost
  • (^) Each node advertises its position
    • (^) Sequence number to avoid loops
    • (^) Maintain fresh routes
  • (^) DSDV basically is distance vector with small adjustments to make it better suited for Ad-hoc networks. These adjustments consist of triggered updates that will take care of topology changes in the time between broadcasts. To reduce the amount of information in these packets there are two types of update messages defined: full and incremental dump. The full dump carries all available routing information and the incremental dump only carries the information that has changed since the last dump. Destination-Sequenced Distance Vector (DSDV) is a variation of the Distributed Bellman-Ford algorithm modified to address problems inherent to Ad-hoc networks, such as time dependent topologies. These modifications reduce the looping properties that would otherwise be present. Since DSDV is table-driven, each node maintains a routing table with the next hop entry for each destination and the metric for the link. In addition, each link has a sequence number associated with it. This sequence number is periodically incremented by the destination node for the link. Other nodes then choose the route with highest sequence number, as that is the least stale route to the destination. If a node detects that a link has broken, it sets the metric to infinity, and issues a route update to the other nodes regarding the link status. Other nodes repeat this action until they receive an update with a higher sequence number to provide it with a fresh route again.
  • (^) Due to the lack of synchronization between nodes in the network, a time delay is imposed to prevent nodes from responding immediately based on a single potentially disruptive update. This settling time allows for the routing table at each node to stabilize before it begins issuing route updates to other nodes.
  • (^) The main advantage to DSDV is that it maintains a loop-free fewest- hop path to every destination in the network. However, this protocol also contains both periodic and triggered route updates. While the triggered updates tend to be small (allowing quick discovery of invalid links), the each node’s periodic update includes its entire routing table. This means the overhead associated with those updates effectively limiting the number of nodes in the network. Because DSDV is dependent on periodic broadcasts it needs some time to converge before a route can be used. This converge time can probably be considered negligible in a static wired network, where the topology is not changing so frequently. In an Ad-hoc network on the other hand, where the topology is expected to be very dynamic, this converge time will probably mean a lot of dropped packets before a valid route is detected. The periodic broadcasts also add a large amount of overhead into the network
  • (^) DSDV Advantages:
    • (^) Short delay brought by the proactive feature
    • (^) Difficult for the attackers to control the propagation of false information
    • (^) Loop Free Fewest hop path
  • (^) DSDV Disadvantages:
    • (^) Difficult to scale to large networks
    • (^) Computation and communication resources wasted on unused routes
    • (^) Periodic updates
    • (^) Maintaining routes in presence of mobility
    • (^) Routing information may be expensive and unnecessary