About DSDV (Destination Sequences Distance Vector)

Introduction:
Each node maintains a set of distance or cost vectors for each possible destination.
Each node periodically broadcasts its routing table to all neighbours.
The routing is hop by hop.
Predicated table structure tuple can be like this:

{Destination Mobile Node Identifier,Sequence Number, Next Neighbour hop information in direction of deestination}

Routes have sequence number.
Routes with higher sequence number are more favorable.

Questions:
1. Periodic updates should be send and received from whom ?
Each node periodically broadcasts its routing table to all neighbours.

2. Route decisiveness based on what matric ? weight or latest or other factor ?Latest is a must as the use of sequence number shows.

Advantage Factors:
1. Guarantees loop-free routes.
2. Simple logic. (Should not be considered as adv. point)

Disadvantage Factors:
1. Hop by hop routing instead of Source routing.
2. Periodical updates.
3. Heavy overhead of exchange of routing information between neighbours.