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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Efficient Ad-Hoc On-demand Distance Vector Routing Protocol using Link State Algorithm

by Mustafa Jasim AL-Jubori, S. S. Pawale, S. R. Shinde
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 26 - Number 2
Year of Publication: 2011
Authors: Mustafa Jasim AL-Jubori, S. S. Pawale, S. R. Shinde
10.5120/3072-4201

Mustafa Jasim AL-Jubori, S. S. Pawale, S. R. Shinde . Efficient Ad-Hoc On-demand Distance Vector Routing Protocol using Link State Algorithm. International Journal of Computer Applications. 26, 2 ( July 2011), 48-52. DOI=10.5120/3072-4201

@article{ 10.5120/3072-4201,
author = { Mustafa Jasim AL-Jubori, S. S. Pawale, S. R. Shinde },
title = { Efficient Ad-Hoc On-demand Distance Vector Routing Protocol using Link State Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { July 2011 },
volume = { 26 },
number = { 2 },
month = { July },
year = { 2011 },
issn = { 0975-8887 },
pages = { 48-52 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume26/number2/3072-4201/ },
doi = { 10.5120/3072-4201 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:11:49.417844+05:30
%A Mustafa Jasim AL-Jubori
%A S. S. Pawale
%A S. R. Shinde
%T Efficient Ad-Hoc On-demand Distance Vector Routing Protocol using Link State Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 26
%N 2
%P 48-52
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

We developed a new algorithm for route discovery, nodes management, and mobility handling for on-demand cache routing on mobile Ad-Hoc networks (MANET). We used Ad-Hoc On demand Distance Vector (AODV) protocol as the better known reactive protocol, as well as using Link State algorithm of the Optimize Link State Routing (OLSR) protocol together. We used two levels of caches memory L-1 and L-2 along with link state routing table for each node. Which maintaining by using the algorithm of OLSR, which working under the AODV protocol. For mobility handling, we used link state algorithm working under AODV to manage node addition, deletion and movement in the network efficiently. We used the Network simulator NS-2 version 2.29 to show the results comparing with the AODV used just cache memory, and comparing with AODV without cache memory. The results shows that our algorithms outperform comparing with AODV without cache memories, and AODV with two levels of cache memory on packet delivery rate, where the link state routing protocol is used to distribute and maintain routing information among various nodes within a domain by using two messages which are Hello messages and Topology Control messages (TC).

References
  1. “A Brief Overview of Ad-Hoc Networks: Challenges and Directions”. Ramanathan and Redi, IEEE Communications Magazine, 5/2002, pp20-22.
  2. “Routing Protocols for Mobile Ad-Hoc Networks”. HumayunBakht,http://www.computingunplugged.com/issues/issue200407/00001326001.html
  3. “Routing Protocols for Ah-Hoc Mobile Wireless Networks” Padmini Misra, http://www.cs.wustl.edu/ ~jain/cis788-99/ftp/Ad-Hoc routing/index.html.
  4. “Caching of Routes in Ad hoc On-demand Distance Vector Routing for Mobile Ad hoc Networks”,Barua and Agarwal, the 15th International Conference on Computer Communication, 2002.
  5. “Reduction of Overheads with Dynamic Caching in Fixed AODV Based MANETs”, Kawish, Aslam, and Khan, World Academy of Science, Engineering and Technology, Communication, 2002.
  6. "Optimized Link State Routing Protocol (OLSR) ," Thomas Clausen, Philippe Jacquet, IETF Internet Draft , July 3 2003.
  7. “Performance Comparison of Ad Hoc Wireless Network Routing Protocols” HumairaEhsan and ZartashAfzalUzmiProceedings of INMIC 8thInternational, 24-26 Dec. 2004, pp-457- 465.
  8. “PerformanceEvaluation of Important Ad-hoc Nnetwork Protocols",S. Ahmed and M. S. Alam, Proceedings of EURASIP Journal on Wireless Communications and Networking Volume 2006, Issue 2 (April 2006), pp- 42 – 42.
  9. “Performance comparison of two on-demand routing protocol for Ad Hoc networks," C. E. Perkins, E. M. Royer, S. R. Das, and M. K. Marina,IEEE Personal Communications Magazine Special Issue on Ad hocNetworking , vol. 8, pp. 16-28, Feb. 2001.
  10. “Lessons from experimental MANET research,” C. Tschudin, P. Gunningberg, H. Lundgren, and E.Nordstrom, Ad Hoc Networks Journal, vol.3, no.2, pp.221–233, 2005.
  11. “Effect of Random Mobility Models Pattern in Mobile Ad Hoc Networks,”S. Gowrishankar, T. G. Basavaraju and S. Sarkar,International Journal of Computer Science and Network Security, Vol. 7, No. 6, 2007, pp. 160-164.
  12. “A Survey of Mobility Models for Ad Hoc Network Research,” T. Camp, J. Boleng and V. Davies, Wireless Communication and Mobile Computing: Special Issue on Mobile Ad Hoc Networking: Research, Trends and Appli-cations, Vol. 2, No. 5 , 2002, pp. 483-502.
  13. “An efficient routing approach as an extension of the AODV protocol”,Luo Chao, Li Ping‟an , in proc. IEEE, vol.1,pp. 95-99,2010.
  14. “A Realistic Model for Evaluation of MANET,” A. J. Pullin, Proceedings of Innovation North Research &Practice Conference, Leeds, 9-11 July 2007, pp. 1-15.
Index Terms

Computer Science
Information Sciences

Keywords

MANET Ad-Hoc On demand Distance Vector (AODV) protocol Optimize Link State Routing (OLSR) protocol route cache route discovery mobility management mobile functions management

Powered by PhDFocusTM