Journal of Computer Science

PERFORMANCE ANALYSIS OF RANDOMIZED REVERSE AD HOC ON DEMAND DISTANCE VECTOR ROUTING PROTOCOL IN MANET

K. Santhi and B. Parvathavarthini

DOI : 10.3844/jcssp.2014.1850.1858

Journal of Computer Science

Volume 10, Issue 9

Pages 1850-1858

Abstract

In high mobility, routing in Mobile Ad-Hoc Network is a very difficult task. In AODV and RAODV, all the data packets are travel through the same shortest path so the intruders can easily trace out the data path. The main objective of Randomized RAODV provides the multipath and then the paths are selected randomly for security purposes. Using randomized routing algorithm to choose the path randomly and then the data packets are travel through different path to reach the destination, so the hackers cannot know about what are the ways the data packets traverse. The performance of proposed RRAODV is compared with the existing routing protocol like AODV, RAODV in mobile network environment. Performance metrics such as packet delivery ratio, end to end delay and control packet overhead are evaluated using NS-2 based on the number of nodes and speeds. Simulation results shows RRAODV gives better performance than the existing protocols like AODV and RAODV for the above metrics. RRAODV is helpful to increase the performance of data transmission and security of data.

Copyright

© 2014 K. Santhi and B. Parvathavarthini. 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.