PERFORMANCE ANALYSIS OF RANDOMIZED REVERSE AD HOC ON DEMAND DISTANCE VECTOR ROUTING PROTOCOL IN MANET
K. Santhi1 & B. Parvathavarthini1 Show affiliations
- , India
Journal of Computer Science, Volume 10, Issue 9, pp. 1850–1858 · doi.org/10.3844/jcssp.2014.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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2014 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Santhi, K. & Parvathavarthini, B. (2014). PERFORMANCE ANALYSIS OF RANDOMIZED REVERSE AD HOC ON DEMAND DISTANCE VECTOR ROUTING PROTOCOL IN MANET. Journal of Computer Science, 10(9), 1850–1858. https://doi.org/10.3844/jcssp.2014.1850.1858
- Licence
- © Science Publications
- Issue
- Volume 10, Issue 9
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
