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

Comparative Simulations for SARA and AODV Routing Algorithms in Ad hoc Network using NS2

by Tamer Hashem Farag, Reem Farag Ahmed
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 143 - Number 10
Year of Publication: 2016
Authors: Tamer Hashem Farag, Reem Farag Ahmed
10.5120/ijca2016910390

Tamer Hashem Farag, Reem Farag Ahmed . Comparative Simulations for SARA and AODV Routing Algorithms in Ad hoc Network using NS2. International Journal of Computer Applications. 143, 10 ( Jun 2016), 1-8. DOI=10.5120/ijca2016910390

@article{ 10.5120/ijca2016910390,
author = { Tamer Hashem Farag, Reem Farag Ahmed },
title = { Comparative Simulations for SARA and AODV Routing Algorithms in Ad hoc Network using NS2 },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2016 },
volume = { 143 },
number = { 10 },
month = { Jun },
year = { 2016 },
issn = { 0975-8887 },
pages = { 1-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume143/number10/25110-2016910390/ },
doi = { 10.5120/ijca2016910390 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:45:57.290666+05:30
%A Tamer Hashem Farag
%A Reem Farag Ahmed
%T Comparative Simulations for SARA and AODV Routing Algorithms in Ad hoc Network using NS2
%J International Journal of Computer Applications
%@ 0975-8887
%V 143
%N 10
%P 1-8
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The past two decades noticed a great development in ad hoc wireless networks. Although most of the routing algorithms that have been produced to ad hoc networks find the shortest discovered path, they have different network performances. It is hard to predict which routing algorithm will perform well under different scenarios. In this paper, an empirical study of the elements that may affect a routing algorithm’s performance using NS2 simulator is presented. AODV and SARA routing algorithms have been chosen to apply the study on and their performances have been investigated under different scenarios. NS2 has been used to simulate three topologies and their performances have been measured. According to the results, it is suggested to use AODV routing algorithm in low interference scenarios and to use SARA routing algorithm in high interference scenarios.

References
  1. S.K. Sarkar, T.G. Basavaraju and C. Puttamadappa, ” Ad hoc mobile wireless networks: principles, protocols and applications,” CRC Press, 2007.
  2. E. Osagie, P. Thulasiraman and R.K. Thulasiram, ”PACONET: imProved ant colony optimization routing algorithm for mobile ad hoc networks,”Advanced Information Networking and Applications, 2008. AINA 2008. 22nd International Conference on. IEEE, pp. 204-211, 2008.
  3. C.E. Perkins and P. Bhagwat, ”Highly dynamic destinationsequenced distance-vector routing (DSDV) for mobile computers,” ACM SIGCOMM computer communication review, Vol. 24, No. 4, pp. 234-244, Oct. 1994.
  4. T. Clausen and P. Jacquet, ”Optimized link state routing protocol (OLSR),” No. RFC 3626, 2003.
  5. C. Perkins, E. Belding-Royer and S. Das, ”Ad hoc on-demand distance vector (AODV) routing,” No. RFC 3561. 2003.
  6. D. Johnson, Y. Hu and D. Maltz, ”The dynamic source routing protocol (DSR) for mobile ad hoc networks,” No. RFC 4728. 2007.
  7. S.R. Das, R. Castaneda, J. Yan and R. Sengupta, ”Comparative performance evaluation of routing protocols for mobile, ad hoc networks,” Computer Communications and Networks, 1998. Proceedings.7th International Conference on. IEEE, pp. 153-161, Oct. 1998.
  8. M. G¨unes, M. K¨ahmer and I. Bouazizi, ”Ant-routing-algorithm (ARA) for mobile multi-hop ad-hoc networks-new features and results,” the second mediterranean workshop on ad-hoc networks, Jun. 2003.
  9. F. Correia and T. Vazˆao, ”Simple ant routing algorithm strategies for a (Multipurpose) MANET model,” Ad Hoc Networks, 8(8), pp. 810-823, 2010.
  10. F.A. Bernat, ”Simulation of Ant Routing Protocol for Ad-hoc networks in NS-2,”Faculty of Electrical Engineering, Mathematics and Computer Science Network Architectures and Services Group, Nov. 2006.
  11. M. Skariah and C.D. Suriyakala, ”An Analysis on the Performance Evaluation of Routing Protocols in Wi-Fi/802.11 b Network,” 2014.
  12. F.D. Sanchez Vizcaino and C. Hernandez Benet, ”Study of TCP Available Bandwidth Using NS2 and Its Forecasting Based on Genetic Algorithm,” 2014.
  13. M. Dorigo, M. Birattari and T. Stutzle, ”Ant colony optimization-artificial ants as a computational intelligence technique,”IEEE Computational Intelligence Magazine 1, no. 4, pp.28-39, Nov. 2006.
  14. G. Di Caro, F. Ducatelle and L.M. Gambardella, ”Swarm intelligence for routing in mobile ad hoc networks,” IEEE Swarm Intelligence Symposium, pp. 76-83, Jun. 2005.
  15. I. Enchev Pervasive, ”MANET routing protocols based on swarm intelligence”, 2011.
  16. M. Manjunath and D.H. Manjaiah, ”PAR: PETAL ANT ROUTING ALGORITHM FOR MOBILE AD HOC NETWORK,” International Journal of Computer Networks and Communications, 7(2), p.45, Mar. 2015.
  17. D. Kaur and N. Kumar, ”Comparative Analysis of AODV, OLSR, TORA, DSR and DSDV Routing Protocols in Mobile Ad-Hoc Networks,”International Journal of Computer Network and Information Security, 5(3), p.39, Mar. 2013.
  18. T. Bhatia and A.K. Verma, ”QoS Comparison of MANET Routing Protocols,”International Journal of Computer Network and Information Security (IJCNIS), 7(9), p.64, Aug. 2015.
  19. F. Correia, Avaialbe:http://cnm.tagus.inescid. pt/software/simple-ant-routing-algorithm-sara, 2012.
Index Terms

Computer Science
Information Sciences

Keywords

Ad hocWireless Network Ad hoc Routing Algorithms Simple Ant Routing Algorithm (SARA) On-demand Algorithms Ad hoc Ondemand Distance Vector (AODV) IEEE 802.11a/b/g

Powered by PhDFocusTM