Performance comparison of two on-demand routing protocols for ad hoc networks

S.R. Das, C.E. Perkins, E.M. Royer
Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)  
n an ad hoc network, mobile nodes communicate with each other using multihop wireless links. There is no stationary infrastructure; for instance, there are no base stations. Each node in the network also acts as a router, forwarding data packets for other nodes. A central challenge in the design of ad hoc networks is the development of dynamic routing protocols that can efficiently find routes between two communicating nodes. The routing protocol must be able to keep up with the high degree of
more » ... ode mobility that often changes the network topology drastically and unpredictably. Such networks have been studied in the past in relation to defense research, often under the name of packet radio networks [1] . Recently there has been a renewed interest in this field due to the common availability of low-cost laptops and palmtops with radio interfaces. Interest is also partly fueled by growing enthusiasm in running common network protocols in dynamic wireless environments without the requirement of specific infrastructures. A mobile ad hoc networking (MANET) working group [2] has also been formed within the Internet Engineering Task Force (IETF) to develop a routing framework for IP-based protocols in ad hoc networks. Our goal is to carry out a systematic performance study of two dynamic routing protocols for ad hoc networks: the Dynamic Source Routing protocol (DSR) [3, 4] and the Ad Hoc On-Demand Distance Vector protocol (AODV) [5, 6] . DSR and AODV share an interesting common characteristic -they both initiate routing activities on an on demand basis. This reactive nature of these protocols is a significant departure from more traditional proactive protocols, which find routes between all source-destination pairs regardless of the use or need for such routes. The key motivation behind the design of on-demand protocols is the reduction of the routing load. High routing load usually has a significant performance impact in low-bandwidth wireless links. While DSR and AODV share the on-demand behavior [7] in that they initiate routing activities only in the presence of data packets in need of a route, many of their routing mechanics are very different. In particular, DSR uses source routing, whereas AODV uses a table-driven routing framework and destination sequence numbers. DSR does not rely on any timerbased activities, while AODV does to a certain extent. One of our goals in this study is to extract the relative merits of these mechanisms. The motivation is that a better understanding of the relative merits will serve as a cornerstone for development of more effective routing protocols for mobile ad hoc networks. The rest of the article is organized as follows. In the following section, we briefly review the DSR and AODV protocols. We present a detailed critique of the two protocols, focusing on the differences in their dynamic behaviors that can lead to performance differences. This lays the foundation for much of the context of the performance study. We describe the simulation environment. We present the simulation results, followed by their interpretations. Related work is presented. We finally draw conclusions and also make recommendations for the improved design of either protocol.
doi:10.1109/infcom.2000.832168 dblp:conf/infocom/DasPR00 fatcat:23atfvq6frbrbob7oujm75jmly