• Aucun résultat trouvé

Multipath Optimized Link State Routing for Mobile ad hoc Networks

N/A
N/A
Protected

Academic year: 2021

Partager "Multipath Optimized Link State Routing for Mobile ad hoc Networks"

Copied!
17
0
0

Texte intégral

Figure

Figure 1: Multiple Dijkstra Algorithm in sparse case. The node disjoint path is non-desirable after node A, B and G are removed.
Figure 3: An example of route recovery. The movement of node G makes the link E to G unavailable
Figure 4: An example of loop in the network. The movement of node C results in inconsistency of the information bases in node A and B
Figure 5: Delivery ratio of MP-OLSR and OLSR in a scenario of 81 nodes and 4 sources
+7

Références

Documents relatifs

Pendant cette période (pro­ phase), l'activité de nucléation des centrosomes augmente considérable­ ment [7] et le réseau interphasique de microtubules se désagrège

In order to obtain this proof of correctness, we use three steps: (a) prove that the graph density reduction preserves maximum bandwidth (this property includes

[r]

So a large state taking the lower position Allies itself with a small state. A small state taking the lower position Is allied with a

كرتفد يف قباسلا لكشلا

[r]

of studying the stimulated_ ru_ by laser _light scattering.: from· a plasma.. ·converter streak camera manufactured by

Gide's autobiography, Si le grain ne meurt, depicts a lonely, withdra~ chi-ldhood centered around a strict, overly. could be mentioned that almost ~very incident