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 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 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

Ant Colony Optimization for Dynamic Routing in Wireless Computer Networks for Improvement in Quality of Services

by Anuj Sharma, Mahendra Pratap Panigrahy
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 70 - Number 5
Year of Publication: 2013
Authors: Anuj Sharma, Mahendra Pratap Panigrahy
10.5120/11960-7799

Anuj Sharma, Mahendra Pratap Panigrahy . Ant Colony Optimization for Dynamic Routing in Wireless Computer Networks for Improvement in Quality of Services. International Journal of Computer Applications. 70, 5 ( May 2013), 31-35. DOI=10.5120/11960-7799

@article{ 10.5120/11960-7799,
author = { Anuj Sharma, Mahendra Pratap Panigrahy },
title = { Ant Colony Optimization for Dynamic Routing in Wireless Computer Networks for Improvement in Quality of Services },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 70 },
number = { 5 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 31-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume70/number5/11960-7799/ },
doi = { 10.5120/11960-7799 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:32:05.376404+05:30
%A Anuj Sharma
%A Mahendra Pratap Panigrahy
%T Ant Colony Optimization for Dynamic Routing in Wireless Computer Networks for Improvement in Quality of Services
%J International Journal of Computer Applications
%@ 0975-8887
%V 70
%N 5
%P 31-35
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Dynamic Routing Assignment (DRA) is a key problem in intelligent optical computer networks. Mathematicians & Computer Scientists started researching the behavior of ants in the early 1990's to find new routing algorithms. The most efficient & widest AI techniques like Swarm particle optimization and Ant colony optimization (ACO) are used to find out solutions for dynamic problems. Ant Colony Optimization (ACO) and in the case of well implemented ACO techniques, optimal performance is comparative to existing top-performing routing algorithms. Such a research has yielded ways to minimize the number of nodes that are taken to get to the destination, techniques for quickly resolving an efficient path, and ways to avoid having loops within a routing scheme. Simulation shows that the modified algorithm decreases the blocking probability and increases the resources utilization comparing with the traditional algorithms.

References
  1. Banik, Bibhash Roy, Biswajit Saha and Nabendu Chaki, "Design of QoS Routing Framework based on OLSR Protocol," ARTCOM 2010, Kochin, Kottyam Kerala, IEEE Explorer, pp-171-73, 2010.
  2. L Chen, WB Heinzelman, A survey of routing protocols that support QoS in mobile ad hoc networks. IEEE Netw 21(6), 30–38 (2007).
  3. L Hanzo II. , R Tafazolli, A survey of QoS routing solutions for mobile ad hoc networks. IEEE Common Surv Tutor 9(2), 50–70 (2007).
  4. P Deepalakshmi, S Radhakrishnan, Ant colony based QoS routing algorithm for mobile ad hoc networks. Int J Recent Trends Eng 1(1), 459–462 (2009).
  5. M Dorigo, G Di Caro, The ant colony meta-heuristic. in New Ideas in Optimization, ed. by Corne D, Dorigo M, Golver F (McGraw-Hill, 1999), pp. 11–32.
  6. J. G. Vlachogiannis, N. D. Hatziargyriou, and K. Y. Lee, "Ant Colony System-based Algorithm for Constrained Load Flow Problem," IEEE Trans on Power Systems, pp. 1241-1249, 2005.
  7. Vittorio Maniezzo, Luca Maria Gambarde, Fabio de Luigi. http://www. cs. unibo. it/ bison/ publications / ACO. pdf
  8. "Ant colonies for the traveling salesman problem" http://www. idsia. ch/~luca/acs-bio97. pdf.
  9. International Journal of Computer Application (0975-8887) No. 4, August 2010: "Comparative Analysis Of ACO and Swarm Optimization Techniques", V. Selvi lec, dept. Of CSE, Nehru Memorial College, Trichy and Dr. R. Umarani Associative Professor, dept of CSE, saratha college of women, salem.
  10. KASSABALIDIS I, El-SHARKAWI M A, MARKS R J. Swarm Intelligence for routing in communication networks. Global Telecommunications, 2001,6(6):3613-3617.
  11. Brian Hill, "The Complete Reference, CISCO", TATA MCGRAW-Hill publishing Ltd. , N. Delhi.
  12. Ant algorithms for discrete optimization. Source, Artificial Life archive. Volume 5 , Issue 2 (April 1999).
  13. O. Cordon, F. Herrera, and T. Stutzle, Special Issue on Ant Colony Optimization: Models and Applications, Mathware and Soft Computing, vol. 9, Dec. 2002.
  14. Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks. Source, Lecture Notes In Computer Science.
  15. AntNet:ACO routing algorithm in practice: Vincent Verstraete, Matthias Strobbe, Erik Van.
Index Terms

Computer Science
Information Sciences

Keywords

Dynamic Routing Assignment Intelligent wireless computer networks Ant colony optimization Blocking probability Resource Utilization

Powered by PhDFocusTM