Journal of Computer Science

Performance Study of Ad-Hoc Reactive Routing Protocols

Pallavi Khatri, Monika Rajput, Alankar Shastri and Keshav Solanki

DOI : 10.3844/jcssp.2010.1159.1163

Journal of Computer Science

Volume 6, Issue 10

Pages 1159-1163

Abstract

Problem statement: In this study, an attempt had been made to compare the performance of the reactive ad-hoc routing protocols using OPNET modeler with respect to increasing number of nodes in the network. Approach: In present study, we compared various reactive routing protocols such as Ad hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA), on the basis of their throughput by increasing number of nodes in the network. Results: Comparative study of routing protocols on the basis of throughput of a network on the basis of number of increasing nodes in the network. Conclusion/Recommendations: Three routing protocols are being studied on the basis of the throughput of the network with respect to the number of increasing nodes in the network and had been concluded that TORA performs better for if the number of nodes in a network are increased.

Copyright

© 2010 Pallavi Khatri, Monika Rajput, Alankar Shastri and Keshav Solanki. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.