The main contribution of the algorithm was to solve the routing loop problem.
Routing information is distributed between nodes by sending full dumps infrequently and smaller incremental updates more frequently.
DSDV requires a regular update of its routing tables, which uses up battery power and a small amount of bandwidth even when the network is idle.
(As in all distance-vector protocols, this does not perturb traffic in regions of the network that are not concerned by the topology change.)
Babel is an attempt at making DSDV more robust, more efficient and more widely applicable while staying within the framework of proactive protocols.