Survey of Mobile Ad-hoc Routing Algorithms
Marc Schiely · 2004
Mobile ad-hoc networks are becoming more and more important. They will become more popular because they have interesting aspects. It is easy and inexpensive to build such networks because no other infrastructure than the mobile devices is needed. One of the remaining problems in mobile ad-hoc networks is to find a routing algorithm which performs good in all common sorts of networks. This thesis analyzes three link reversal routing algorithms on how the algorithms behave on different classes of networks. Therefor a simulation was made. The framework which was implemented for simulating mobile routing algorithms is presented in this thesis. It is shown how the framework can be used for simulating other mobile routing algorithms. The results from the simulation are not very spectacular. Unfortunately no noticeable dependence exists between network density, network mobility and the performance of the algorithms. What we expected was, that there exist network scenarios where an algorithm which is bad in one scenario is best in this scenarios. Also the simulation on different classes of networks does not show any unexpected results. There is no noticeable difference between the performance of the algorithms on different classes of networks. It is always the same of the analyzed algorithms which is best for all four scenarios.