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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Swarm Intelligent Application in Networks Routing Problem

by Firas Ali Hashim
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 133 - Number 1
Year of Publication: 2016
Authors: Firas Ali Hashim
10.5120/ijca2016907730

Firas Ali Hashim . Swarm Intelligent Application in Networks Routing Problem. International Journal of Computer Applications. 133, 1 ( January 2016), 25-28. DOI=10.5120/ijca2016907730

@article{ 10.5120/ijca2016907730,
author = { Firas Ali Hashim },
title = { Swarm Intelligent Application in Networks Routing Problem },
journal = { International Journal of Computer Applications },
issue_date = { January 2016 },
volume = { 133 },
number = { 1 },
month = { January },
year = { 2016 },
issn = { 0975-8887 },
pages = { 25-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume133/number1/23752-2016907730/ },
doi = { 10.5120/ijca2016907730 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:29:56.039507+05:30
%A Firas Ali Hashim
%T Swarm Intelligent Application in Networks Routing Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 133
%N 1
%P 25-28
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents an Ant Colony Optimization (ACO) approach used to find the optimal solutions in the routing problem; it is one of the swarm intelligent applications. The Proposed method is used to determine the optimal path from source to destination for any size of networks. Optimal Path means the less cost path. The packets are sent from source node to destination node throw all node from one to another, which are traveling through the computer network. ACO algorithm can successfully find the optimal path and reduce the time.

References
  1. R.Geetha, and G. Srikanth, "Ant Colony optimization based Routing in various Networking Domains-ASurvey", International Research Journal of Mobile and Wireless Communications, ICICES-2012-SAEC, Chennai, Tamilnadu, Vol 3, Issue 1; January-April,2012.
  2. Dalia Sabri," Performance Analysis for Network Coding Using Ant Colony Routing", Master of Philosophy, Electronic and Computer Engineering, School of Engineering and Design, Brunel University, December, 2011.
  3. Xiao-Min Hu and Jun Zhang,"Minimum Cost Multicast Routing Using Ant Colony Optimization Algorithm", Hindawi Publishing Corporation, Mathematical Problems in Engineering, Article ID 432686, 18April, 2013.
  4. Marco dorigo and Thomas stuzle Bradford company scituate,MA "Ant colony optimization ", USA 2004 ISBN: 0262042193.
  5. Helio,J.C.Barbosa,Janeza"Ant colonyoptimization–techniques and applications" Trdine9, 51000 Rijeka, Croatia, 2013.
  6. "Ant colony optimization – methods and applications" edited by Aviostfeld ISBN 978-953-307-157-2, Puplushed: February4, 2011 Under CC by-NC-SA3.0 License.
  7. C.W.Ahn,R.S.Ramakrishna,C.G.Kang.AndI.C.Choi.“Shortestpath Routing algorithm using Hopfield Neural Network”. Electron. Lett. Vol. 37 No. 19 PP. 1176-1178. Sept, 2001.
  8. Aboul Ella Hassanien ,Eid Emary"Swarm intelligence: principles, advances , and application" by CRC Press referenc-210pages-25 B/M IIustration ISBN78148741064-cat#k26721. November 24,2015
  9. Computational intelligence methods and technique leszk ruttkowski, 2008.
  10. "Ant colony optimization" Edwin Wong, Phillip Summers,Rosalyn Ku, and Patrick Xie, PIC 10C Spring 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Ant Colony Optimization (ACO) Swam Intelligent Networks Routing Optimal Path

Powered by PhDFocusTM