Simulation and Performance Analysis of AODV, TORA & OLSR Routing Protocols
Harpreet Singh1, Manpreet Kaur2

1Harpreet Singh, Department of Computer Science, Punjabi University, Patiala (Punjab) India.
2Manpreet Kaur, Department of Computer Science, UCOE, Punjabi University, Patiala (Punjab) India.

Manuscript received on 21 November 2013 | Revised Manuscript received on 28 November 2013 | Manuscript published on 30 November 2013 | PP: 66-70 | Volume-2 Issue-5, November 2013 | Retrieval Number: E0873112513/2013©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any pre-existing network infrastructure. A number of ad hoc routing protocols have been developed during the time, but none of these is able to produce efficient routing of packets in large number of nodes due to their own limitations. Therefore, scalability is an open issue in all routing protocols. In this paper, we presented our observations regarding the scalability comparison of the three MANET routing protocols, Ad hoc On Demand Distance Vector (AODV), Temporally Ordered Routing Protocols (TORA) and Optimized Link State Routing (OLSR) by varying the number of nodes. The simulation is done by using OPNET Modeler 14.5 simulator by taking throughput and network delay as performance metrics. In case of delay AODV and OLSR perform in a similar manner as the number of nodes increases. However, in throughput OLSR outperforms AODV and TORA.
Keywords: AODV, MANET, OLSR, Scalability, TORA

Scope of the Article: Routing and Transport Protocols