Content deleted Content added
m robot Modifying: de |
Alvestrand (talk | contribs) No edit summary |
||
Line 3:
The advantage of this approach is that connections are made quickly. The disadvantage is that the communication to discover network members occurs continuously. Also, calculation and memory burdens are continuing, and may be too heavy for small computers. The program is fairly large and complex.
OLSR is one of several solutions to this problem. Another is [[AODV]], a [[distance vector routing protocol]] solving the same problem. Distance vector routing is simpler, requires less memory and calculation, but requires more delay, and when a route is needed, communication is much heavier. Another is [[Dynamic Source Routing]], which substantially optmizes the network traffic. Another is [[Hazy Sighted Link State Routing Protocol]], a careful mathematical optimization of proactive link-state features and reactive features. For other alternatives see the [[Ad hoc routing protocol list]].
==External link==
|