International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 140 - Issue 6 |
Published: April 2016 |
Authors: B. Karthikeyan, S. Hari Ganesh, J.G.R. Sathiaseelan |
![]() |
B. Karthikeyan, S. Hari Ganesh, J.G.R. Sathiaseelan . Optimal Time Bound Ad-Hoc On-demand Distance Vector Routing Protocol (OpTiB-AODV). International Journal of Computer Applications. 140, 6 (April 2016), 7-11. DOI=10.5120/ijca2016909317
@article{ 10.5120/ijca2016909317, author = { B. Karthikeyan,S. Hari Ganesh,J.G.R. Sathiaseelan }, title = { Optimal Time Bound Ad-Hoc On-demand Distance Vector Routing Protocol (OpTiB-AODV) }, journal = { International Journal of Computer Applications }, year = { 2016 }, volume = { 140 }, number = { 6 }, pages = { 7-11 }, doi = { 10.5120/ijca2016909317 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2016 %A B. Karthikeyan %A S. Hari Ganesh %A J.G.R. Sathiaseelan %T Optimal Time Bound Ad-Hoc On-demand Distance Vector Routing Protocol (OpTiB-AODV)%T %J International Journal of Computer Applications %V 140 %N 6 %P 7-11 %R 10.5120/ijca2016909317 %I Foundation of Computer Science (FCS), NY, USA
Ad-Hoc On demand Distance (AODV) routing protocol is one of the reactive on-demand routing protocol. It is one of the multicast routing protocol. The basic AODV protocol does not have and mechanism to reduce the end to end time delay. The proposed algorithm Optimal Time Bound (OpTiB)-AODV routing protocol introduce five different way to reduce the end to end time taken. This proposed OpTiB AODV implemented and tested by the use of OmNet++.