الفهرس 
Title : Routing Algorithms over Ad Hoc Wireless Networks
AbstractOnly 14 pages are availabe for public view
 |  | from | 88 |  |  |
| | | from | 88 | | |
Abstract
Along the past two decades, a lot of routing algorithms were implemented to ad hoc wireless networks. Although most of them nd the shortest discovered path, they have di erent network performances. In this thesis, an empirical study is conducted to dis-cover the guidelines required for selecting the highest performance routing algorithm. The study has been conducted on two routing algorithms (AODV and SARA) and three topologies. The three topologies have been selected to represent three levels of interfer- ence. The characteristics of the routing algorithms have been investigated under di erent scenarios. According to the results, higher performance of the AODV routing algorithm has been observed in lower interference scenarios. On the other hand, higher performance of the SARA routing algorithm has been observed in higher interference scenarios