We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Application of an Evolutionary Optimization Technique to Routing in Mobile Wireless Networks

by Ibraheem K. Ibraheem, Alyaa A. Alhussainy
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 99 - Number 7
Year of Publication: 2014
Authors: Ibraheem K. Ibraheem, Alyaa A. Alhussainy
10.5120/17385-7922

Ibraheem K. Ibraheem, Alyaa A. Alhussainy . Application of an Evolutionary Optimization Technique to Routing in Mobile Wireless Networks. International Journal of Computer Applications. 99, 7 ( August 2014), 24-31. DOI=10.5120/17385-7922

@article{ 10.5120/17385-7922,
author = { Ibraheem K. Ibraheem, Alyaa A. Alhussainy },
title = { Application of an Evolutionary Optimization Technique to Routing in Mobile Wireless Networks },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 99 },
number = { 7 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 24-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume99/number7/17385-7922/ },
doi = { 10.5120/17385-7922 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:27:34.500455+05:30
%A Ibraheem K. Ibraheem
%A Alyaa A. Alhussainy
%T Application of an Evolutionary Optimization Technique to Routing in Mobile Wireless Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 99
%N 7
%P 24-31
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The main goal of this work is to consider the problem of path optimization between the sender and receiver in a dynamic mobile network. A new adaptive algorithm based on Evolutionary technique called Genetic Algorithm (AGA) has been proposed to find out the Optimal Path in dynamic nature problem. In this paper, the proposed AGA for solving the shortest path routing problem is presented to find the shortest path in a mobile wireless networks to satisfy the minimum end-to-end delay quality of service (QoS). The proposed algorithm provides the solution of optimal path using a technique that is inspired by the natural process that is initial population, selection crossover and mutation. The proposed AGA uses a multiple selection methods to improve the performance of particular implementations. Simulations have been done using both MATLAB and Visual basic environments and the results show that the proposed algorithm performs excellently by finding a path with minimum end-to-end delay between source and destination; it finds the shortest path in dynamic environment efficiently and quickly adapts to the environmental changes (i. e. , the network topology change) and produces good solutions after each change.

References
  1. M. Gast. 2002. 802. 11® Wireless Networks: The Definitive Guide. Publisher: O'Reilly, ISBN: 0-596-00183-5.
  2. H. N. Saad. 2010. Source routing: Best rout using genetic algorithm. Journal of Kufa for Mathematics and Computer, Vol. 1, No. 2, Oct. , pp. 35 – 45.
  3. R. Kumar and M. Kumar. 2012. Reliable and Efficient Routing Using Adaptive Genetic Algorithm in Packet Switched Networks. IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 3, January 2012, ISSN (Online): 1694-0814.
  4. Z. Ishtar, K. B. Ali. 2013. Optimization of Route in a Network using Genetic Algorithm. International Conference on Advances in Computer Application (ICACA - 2013), Proceedings published in International Journal of Computer Applications® (IJCA) (0975 -8887).
  5. L. Badia, A. Botta, L. Lenzini. 2007. Joint Routing and Link Scheduling for Wireless Mesh Networks through Genetic Algorithms. IEEE International Conference 16-20 April 2007, Limassol.
  6. H. Cheng, Sh. Yang. 2010. Multi-population Genetic Algorithms with Immigrants Scheme for Dynamic Shortest Path Immigrants Scheme for Dynamic Shortest Path. Lecture notes in computer science, Volume 6024, 2010, pp 562-571.
  7. Mahesh K. Marina, Samir R. Das. 2002. Routing Performance in the Presence of Unidirectional Links in Multihop Wireless Networks. Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing. ACM, 2002.
  8. T. R. G. Nair , Ms. K. Sooda, Ms. Y. M B. 2011 Enhanced Genetic Algorithm approach for Solving Dynamic Shortest Path Routing Problems using Immigrants and Memory Schemes. International Conference on Frontiers of Computer Science,7 TH TO 9 TH August 2011, JN Tata Convention Centre, IISc, Bangalore, India.
  9. Y. Zhao, R. Sun, and L. Xu. 2010. An Ant Simulated Annealing Routing Algorithm for Wireless Mesh Network. IEEE International Conference on Internet Technology and Applications. pages 1-4.
  10. H. Yetgin, K. T. K. Cheung and L. Hanzo. 2012 Multi-objective Routing Optimization Using Evolutionary Algorithms. IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, PARIS, APRIL 2012.
  11. J. Crichigno, J. Khoury, M. Y. Wu , and W. Shu. 2008. A Dynamic Programming Approach for Routing in Wireless Mesh Networks. Global Telecommunications Conference, IEEE GLOBECOM.
  12. Fatemeh K. Purian, Reza S. Nodoshan. 2013. A Novel Method to Find the shortest Path in Wireless Networks. Journal of Academic and Applied Studies. Vol. 3, pages 1-14.
  13. Mala C, A. A. Mahesh, R. Aravind, R. Rajgopal, N. Rajagopalan. B. Nithya. 2011. Simulated Study of QoS Multicast Routing Using Genetic Algorithm. World Applied Programming, Vol (2), Issue (5), May 2012. 342-348, ISSN: 2222-2510, ©2011 WAP journal. www. waprogramming. com.
  14. R. L. Haupt and S. E. Haupt. 2004. Practical Genetic Algorithm. 2nd Edition, Wiley.
  15. A. Mohammed. , G. Nagib. 2012. Optimal Routing In Ad-Hoc Network Using Genetic Algorithm. Int. J. Advanced Networking and Applications, Volume: 03, Issue: 05, Pages: 1323-1328 (2012).
  16. Ch. W. Ahn, R. S. Ramakrishna. 2002. A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 6, DECEMBER 2002.
  17. M. R. Girgis, T. M. Mahmoud1, H. F. Abd el- Hammed, and Z. M. El-Saghier. 2013. Routing And Capacity Assignment Problem in Computer Networks Using Genetic Algorithm. Information, Science Letters. Let 2, No. 1, 13-25 (2013).
  18. Mehta, A. Sharma. 2013. Observing the Effect of Elitism on the Performance of GA. International Journal of Advanced Research in Computer Science and Software Engineering. Volume 3, Issue 6, June 2013 Research Paper Available online at: www. ijarcsse. com.
  19. N. M. Razali, J. Geraghty. 2011. Genetic Algorithm Performance with Different Selection Strategies in Solving TSP. Proceedings of the World Congress on Engineering 2011 Vol II ,WCE 2011, July 6 - 8, 2011, London, U. K.
  20. M. Mitchell. 1999. An introduction to Genetic algorithm. 1st edition, MIT Press, London, England.
  21. E. G. 1989. Genetic Algorithms in Search, Optimization and Machine Learning, University of Alabama.
Index Terms

Computer Science
Information Sciences

Keywords

Quality of Service (QoS) mobile networks end-to-end delay network traffic networks nodes evolutionary optimization.