CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Optimal Time Bound Ad-Hoc On-demand Distance Vector Routing Protocol (OpTiB-AODV)

by B. Karthikeyan, S. Hari Ganesh, J.G.R. Sathiaseelan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 140 - Number 6
Year of Publication: 2016
Authors: B. Karthikeyan, S. Hari Ganesh, J.G.R. Sathiaseelan
10.5120/ijca2016909317

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 },
issue_date = { April 2016 },
volume = { 140 },
number = { 6 },
month = { April },
year = { 2016 },
issn = { 0975-8887 },
pages = { 7-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume140/number6/24596-2016909317/ },
doi = { 10.5120/ijca2016909317 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:41:33.628215+05:30
%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)
%J International Journal of Computer Applications
%@ 0975-8887
%V 140
%N 6
%P 7-11
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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++.

References
  1. Xiaoxia Qi ,Qijin Wang and Fan Jiang, “ Multi-path Routing Improved Protocol in AODV Based on Nodes Energy”, International Journal of Future Generation Communication and Networking Vol. 8, No. 1 (2015), pp. 207-214
  2. Manoj Tolani, Rajan Mishra,l “ Effect of Packet Size on Various MANET Routing Protocols”, International Journal of Applied Information Systems (IJAIS) – ISSN : 2249-0868 Volume 4– No.9, December 2012,PP:10-13.
  3. Shruti Bhalodiya and Krunal Vaghela, “ Study of Detection and Prevention Techniques for Flooding attack on AODV in MANET” International Journal of Science and Research (IJSR), Volume 4 Issue 1, January 2015,PP: 433-436
  4. Alisha Dua, Sandeep Dalal and Kamna Solanki, “Efficient Routing Technique in Heterogeneous Wireless Network”, International Journal of Computer Applications (0975 – 8887) Volume 127 – No.14, October 2015,PP:36-39.
  5. Neha Agarwal and Neeraj Manglani, “A New Approach for Energy Efficient Routing in MANETs Using Multi Objective Genetic Algorithm”, International Journal of Science, Engineering and Technology Research (IJSETR), Volume 4, Issue 6, June 2015pp 1780-1784.
  6. B.Karthikeyan, N.Kanimozhi and Dr.S.Hari Ganesh, Performance and Analysis of Ad-Hoc Network Routing Protocols in MANET,NCAC,April 2013, pp 65-71.
  7. B.Karthikeyan, N.Kanimozhi and Dr.S.Hari Ganesh, Analysis of Reactive AODV Routing Protocol for MANET‖, IEEE Explore, Oct 2014, pp 264-267.
  8. B.Karthikeyan, N.Kanimozhi and Dr.S.Hari Ganesh, Complexity in Security Issues of MANET Pertaining to AODV Protocol‖, International Conference on Contemporary Trends in Computer Science (CTCS - 2014). Feb 2014, pp 264-267.
  9. B..Karthikeyan, N.Kanimozhi and Dr.S.Hari Ganesh- Security and Time Complexity in AODV Routing Protocol, IJAER, pp15542- 155546, Vol 20,June 2015.
  10. B..Karthikeyan, N.Kanimozhi and Dr.S.Hari Ganesh- Security Improved Ad-Hoc On-demand Distance Vector Routing Protocol, IJRE, pp, Vol ,On Print.
  11. B..Karthikeyan, N.Kanimozhi and Dr.S.Hari Ganesh- Security and Time Complexity in AODV Routing Protocol, IJAER, pp15542- 155546, Vol 20,June 2015.
Index Terms

Computer Science
Information Sciences

Keywords

AODV OpTiB OmNet++

Powered by PhDFocusTM