**2.2.1 DSDV (Dynamic Destination-Sequence Distance – Vector routing protocol)**

This protocol is based on the BELLMANFORD routing idea, with a series of improvements [Bagad V. S and Dhotre, 2009]. Each mobile base maintains a routing table that includes all accessible destinations, the number of hops necessary for reaching that destination and the sequence of the digits appropriate to that destination. This sequence of digits is used to distinguish new routes from old routes and to determine the creation of a ring. In DSDV, stations send their routing tables alternatively to their direct neighbors [Maan. F and Mazhar. N., 2011]. Tables are updated generally in two perfect updating and incremental updating methods. Any route updating package increases information about routing. This protocol performs periodic updates, but also generates a supplementary traffic that adds to the real data traffic. [Bamis. A et al, 2007].
