<s>
Destination-Sequenced	O
Distance-Vector	O
Routing	O
(	O
DSDV	B-Protocol
)	O
is	O
a	O
table-driven	O
routing	O
scheme	O
for	O
ad	B-Protocol
hoc	I-Protocol
mobile	I-Protocol
networks	I-Protocol
based	O
on	O
the	O
Bellman	B-Algorithm
–	I-Algorithm
Ford	I-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
The	O
main	O
contribution	O
of	O
the	O
algorithm	O
was	O
to	O
solve	O
the	O
routing	B-Protocol
loop	I-Protocol
problem	I-Protocol
.	O
</s>
<s>
DSDV	B-Protocol
requires	O
a	O
regular	O
update	O
of	O
its	O
routing	O
tables	O
,	O
which	O
uses	O
up	O
battery	O
power	O
and	O
a	O
small	O
amount	O
of	O
bandwidth	O
even	O
when	O
the	O
network	O
is	O
idle	O
.	O
</s>
<s>
Whenever	O
the	O
topology	O
of	O
the	O
network	O
changes	O
,	O
a	O
new	O
sequence	O
number	O
is	O
necessary	O
before	O
the	O
network	O
re-converges	O
;	O
thus	O
,	O
DSDV	B-Protocol
is	O
not	O
suitable	O
for	O
highly	O
dynamic	O
or	O
large	O
scale	O
networks	O
.	O
</s>
<s>
While	O
DSDV	B-Protocol
itself	O
does	O
not	O
appear	O
to	O
be	O
much	O
used	O
today	O
,	O
other	O
protocols	O
have	O
used	O
similar	O
techniques	O
.	O
</s>
<s>
The	O
best-known	O
sequenced	O
distance	O
vector	O
protocol	O
is	O
AODV	B-Device
,	O
which	O
,	O
by	O
virtue	O
of	O
being	O
a	O
reactive	O
protocol	O
,	O
can	O
use	O
simpler	O
sequencing	O
heuristics	O
.	O
</s>
<s>
Babel	B-Protocol
is	O
an	O
attempt	O
at	O
making	O
DSDV	B-Protocol
more	O
robust	O
,	O
more	O
efficient	O
and	O
more	O
widely	O
applicable	O
while	O
staying	O
within	O
the	O
framework	O
of	O
proactive	O
protocols	O
.	O
</s>
