<s>
The	O
Temporally	B-Protocol
Ordered	I-Protocol
Routing	I-Protocol
Algorithm	I-Protocol
(	O
TORA	O
)	O
is	O
an	O
algorithm	O
for	O
routing	B-Protocol
data	O
across	O
Wireless	O
Mesh	O
Networks	O
or	O
Mobile	B-Protocol
ad	I-Protocol
hoc	I-Protocol
networks	I-Protocol
.	O
</s>
<s>
Park	O
has	O
patented	O
his	O
work	O
,	O
and	O
it	O
was	O
licensed	O
by	O
Nova	O
Engineering	O
,	O
who	O
are	O
marketing	O
a	O
wireless	O
router	B-Protocol
product	O
based	O
on	O
Park	O
's	O
algorithm	O
.	O
</s>
<s>
The	O
TORA	O
attempts	O
to	O
achieve	O
a	O
high	O
degree	O
of	O
scalability	B-Architecture
using	O
a	O
"	O
flat	O
"	O
,	O
non-hierarchical	O
routing	B-Protocol
algorithm	I-Protocol
.	O
</s>
<s>
In	O
order	O
to	O
achieve	O
this	O
,	O
the	O
TORA	O
does	O
not	O
use	O
a	O
shortest	O
path	O
solution	O
,	O
an	O
approach	O
which	O
is	O
unusual	O
for	O
routing	B-Protocol
algorithms	I-Protocol
of	O
this	O
type	O
.	O
</s>
<s>
By	O
maintaining	O
a	O
set	O
of	O
totally	O
ordered	O
heights	O
at	O
all	O
times	O
,	O
TORA	O
achieves	O
loop-free	O
multipath	O
routing	B-Protocol
,	O
as	O
information	O
cannot	O
'	O
flow	O
uphill	O
 '	O
and	O
so	O
cross	O
back	O
on	O
itself	O
.	O
</s>
<s>
To	O
accomplish	O
this	O
,	O
nodes	O
need	O
to	O
maintain	O
the	O
routing	B-Protocol
information	I-Protocol
about	O
adjacent	O
(	O
one	O
hop	O
)	O
nodes	O
.	O
</s>
<s>
During	O
the	O
times	O
of	O
mobility	O
the	O
DAG	O
is	O
broken	O
and	O
the	O
route	O
maintenance	O
unit	O
comes	O
into	O
picture	O
to	O
reestablish	O
a	O
DAG	O
routed	B-Protocol
at	O
the	O
destination	O
.	O
</s>
