Optimal path selection in graded network using Artificial Bee Colony algorithm with agent enabled information

In this paper we propose a network aware approach for routing in graded network using Artificial Bee Colony (ABC) algorithm. ABC has been used as a good search process for optimality exploitation and exploration. The paper shows how ABC approach has been utilized for determining the optimal path based on bandwidth availability of the link and how it outperformed non graded network while deriving the optimal path. The selection of the nodes is based on the direction of the destination node also. This would help in narrowing down the number of nodes participating in routing. Here an agent system governs the collection of QoS parameters of the nodes. Also a quadrant is synthesized with centre as the source node. Based on the information of which quadrant the destination belongs, a search is performed. Among the many searches observed by the onlooker bees the best path is selected based on which onlooker bee comes back to source with information of the optimal path. The simulation result shows that the path convergence in graded network with ABC was 30% faster than non-graded ABC.

[1]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[2]  T. R. Gopalakrishnan Nair,et al.  A Novel Adaptive Routing through Fitness Function Estimation Technique with Multiple QoS Parameters Compliance , 2011, ArXiv.

[3]  Seongkwan Kim,et al.  On optimal route construction in wireless mesh networks , 2009, 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications.

[4]  Alan F. Murray,et al.  IEEE International Conference on Neural Networks , 1997 .

[5]  Valery Tereshko,et al.  Reaction-Diffusion Model of a Honeybee Colony's Foraging Behaviour , 2000, PPSN.

[6]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[7]  Yanif Ahmad,et al.  Networked Query Processing for Distributed Stream-Based Applications , 2004, VLDB.

[8]  J. Medhi,et al.  Stochastic models in queueing theory , 1991 .

[9]  Yang Xu,et al.  Traffic-Aware Routing Protocol for Cognitive Network , 2010, 2010 IEEE 72nd Vehicular Technology Conference - Fall.

[10]  S. Venkatesan,et al.  Control channel based MAC-layer configuration, routing and situation awareness for cognitive radio networks , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[11]  T. R. Gopalakrishnan Nair,et al.  Particle Swarm Optimization for Realizing Intelligent Routing in Networks with Quality Grading , 2011, 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing.

[12]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[13]  A. Mellouk,et al.  Reinforcing State-Dependent N Best Quality of Service Routes in Communication Networks , 2007, 2007 Workshop on High Performance Switching and Routing.