An Efficient Multiple Ant Colony Based Routing Protocol to Support Multimedia Communication in Ad Hoc Wireless Network
The major problem in Ad hoc Networks is to find a route between the communication end points. The topology of the network changes constantly due to the mobility of the nodes and paths which were initially competent and can quickly become incompetent or even infeasible. Ant Colony Optimization (ACO) is a biological inspiration simulating the ability of real ant colony of finding the shortest path between the nest and food source. Ant colony algorithms are motivated by the observation of real ant colonies. ACO is one of the successful applications of Swarm Intelligence (SI) which is the field of Artificial Intelligence (AI) that studies the intelligent behavior of ants. In this paper, Multiple Ant Colony Optimization based routing protocol is used to support multimedia communication in Ad Hoc Network. This approach avoids the stagnation problem on ants. This approach increases effectiveness and adaptiveness. Moreover, tabu search is used in this approach which avoids the blind alley problem of ants.
Baras J. S., “Dynamic Adaptive Routing in MANETs: New Algorithms Using Swarm Intelligence”, Distinguished Lecture in the ARL CTA C & N Technical Talk Series, 2002; presentation available at www.isr.umd.edu/People/faculty/Baras.html.
Qi Shen, Jian-Hui Jiang, Jing-chao Tao, Guo-li Shen and Ru-Qin Yu, “Modified Ant Colony Optimization Algorithm for Variable Selection in QSAR Modeling: QSAR Studies of Cyclooxygenase Inhibitors”, J. Chem. Inf. Model., Vol. 45, No. 4, pages 1024–1029, 2005.
Hua Wang, Zhao Shi and Jun Ma, “A Modified Ant Colony Algorithm for Multi-constraint Multicast Routing”, 1-4244-0463-0/06/$20.00 ©2006 IEEE, 2006.
Zhihong Xu, Xiangdan Hou and Jizhou Sun, “Ant Algorithm Based Task Scheduling in Grid Computing”, IEEE Conference Paper, 2003.
Dorigo M., Di Caro G., and Gambardella L. M., “Ant algorithms for Discrete Optimization”, Artificial Life, Vol. 5, No. 2, pages 137-172, 1999.
Marco Dorigo, Mauro Birattari and Thomas Stutzle, “Ant Colony Optimization”, IRIDIA – Technical Report Series, Technical Report No, TR/IRIDIA/2006-023, 2006.
Gianni Di Caro and Athanasios V. Vasilakos, “AntNet Combined to Stochastic Estimator (SELA) for QoS routing in ATM networks”, ANTS’2000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Colony Optimization, Brussels, Belgium, 2000.
Mesut Gunes, Martin Kahmer and Imed Bouazizi, “Ant-Routing-Algorithm (ARA) For Mobile Multi-Hop Ad-Hoc Networks New Features and Results”, Proceedings of the Med-Hoc Net 2003 Workshop Mahdia, Tunisia, pages 25-27, 2003
Royer E. M., and Toh C. K., “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks”, IEEE Personal Communications Magazine, pages 46-55, 1999.
Fernando C., and Teresa V., “Simple Ant Routing Algorithm," Proceeding of International Conference on Information Networking, pages 486-493, Busan, South Korea, 2008.
Weihui Dai, Shouji Liu and Shuyi Liang, “An Improved Ant Colony Optimization Cluster Algorithm Based on Swarm Intelligence”, Journal of Software, Vol. 4, No. 4, 2009.
Brahim Gasbaoui and Boumediene Allaoua, “Ant Colony Optimization Applied on Combinatorial Problem for Optimal Power Flow Solution”, Leonardo Journal of Sciences, No. 14, pages 1-17, 2009.
UC Berkeley, LBL, USC/ISI, and Xerox PARC. The ns Manual. Available from: http://www.isi.edu/nsnam/ns/ns-documentation.html.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.