Resolving Dynamic Shortest Path Routing Problems in Mobile Adhoc Networks Using ABCAnd ACO
 |
International Journal of Computer & Organization Trends (IJCOT) | 
|
| © 2013 by IJCOT Journal | ||
| Volume-3 Issue-1 |
||
| Year of Publication : 2013 | ||
| Authors : C.Ambika, M.Karnan, R.Sivakumar, |
Citation
C.Ambika, M.Karnan, R.Sivakumar, "Resolving Dynamic Shortest Path Routing Problems in Mobile Adhoc Networks Using ABCAnd ACO" . International Journal of Computer & organization Trends (IJCOT), V3(1):58-62 Jan - Feb 2013, ISSN:2249-2593, www.ijcotjournal.org. Published by Seventh Sense Research Group.
Abstract
Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is self organized and self managed network. MANET is decentralized b y a collection of mobile nodes. The major problem in MANET is fast changing nature due to the random movement of the nodes. Routing is the process of moving information across the network from a source to a destination. Routing is challenging in this type of networks due to the mobility of nodes, energy and limited resources etc. T his type of networks has difficult to find a path between the communicating nodes. Nature - inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms and Artificial Bee Colony (ABC) algorithm have shown to be a good technique for identifying multiple stable paths between source and destination nodes. The Ant Colony Optimization (ACO) algorithm is proposed for finding dynamic shortest path and also avoi ding the convergence to a locally optimal solution. The Artificial Bee Colony (ABC) algorithm is proposed for finding the dynamic shortest path with best parameter vector which minimizes an objective function.
References
[1]. S hengxiang Yang, Hui Cheng, and Fang Wang,” Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks”, IEEE transactions on systems, man, and cybernetics — part c: applications and reviews, vol .40, no. 1, January 2010.
[2]. C. W. Ahn and R. S. Ramakrishna, “A genetic algorithm for shortest path routing problem and the sizing of populations,” IEEE Trans. Evol.Comput., vol. 6, no. 6, pp. 566 – 579, Dec. 2002.
[3].Ajay C Solai Jawahar,”Ant Colony Opt imization for mobile Adhoc networks”
[4].S.B.Wankhade,M.S.Ali”Ant based techniques for QoS routing in mobile adhoc network:An overview”, Int.J.Advanced Networking and Applications vol;3,issue:2,2011
[5].Bibhash Roy,Suman BAnik”Ant Colony based routing for mobile adhoc networks towards improved quality of services”,journal of emerging trends in computing and information sciences vol.3,no.1,jan 2012
[6]dervis karaboga,”Artificial bee Colony algorithm” 2010
[7]Adil Baykasoglu,lale ozbakir”Artificial Bee colony algorithm and its application to generalized assignment problem”
[8]. J. Branke, “Memory enhanced evolutionary algorithms for changing optimization problems,” in Proc. 1999 Congr. Evol. Comput. pp. 1875 – 1882.
[9].J. J. Grefenstette, “Genetic algorithms fo r changing environments,” in Proc. 2nd Int. Conf. Parallel Problem Solving Nature , 1992, pp. 137 – 144.
[10] S. Yang, “Genetic algorithms with elitism - based immigrants for changing optimization problems,” in Proc. EvoWorkshops 2007: Appl. Evol. Comput. (Lec ture Notes in Computer Science), vol. 4448, pp.627 – 636.
[11] D. Din, “Anycast routing and wavelength assignment problem on WDM network,” IEICE Trans. Commun. , vol. E88 - B, no. 10, pp. 3941 – 3951,Oct. 2005.
[12] J. J. Grefenstette, “Genetic algorithms for cha nging environments,” in Proc. 2nd Int. Conf. Parallel Problem Solving Nature , 1992, pp. 137 – 144.
[13] S. Lee, S. Soak, K. Kim, H. Park, and M. Jeon, “Statistical properties analysis of real world tournament selection in genetic algorithms,” Appl.Intell. , v ol. 28, no. 2, pp. 195 – 2205, Apr. 2008.
[14] E. Lewis and G. Ritchie, “A comparison of dominance mechanisms and simple mutation on non - stationary problems,” in Proc. 5th Int. Conf.Parallel Problem Solving Nature , 1998, pp. 139 – 148.
[15] S. Louis and Z. Xu, “Genetic algorithms for open shop scheduling and re - scheduling,” in Proc. 11th ISCA Int. Conf. Comput. Appl. , 1996, pp. 99 – 102.
[16] S. Misra and B. J. Oommen, “GPSPA: A new adaptive algorithm for maintaining shortest path rou ting trees in stochastic networks,” Int. J.Commun. Syst. , vol. 17, no. 10, pp. 963 – 984, 2004.
[17] A. W. Mohemmed, N. C. Sahoo, and T. K. Geok, “Solving shortest path problem using particle swarm optimization,” Appl. Soft Comput. , vol. 8,no. 4, pp. 1643 – 16 53, Sep. 2008.
[18] H. Mori and Y. Nishikawa, “Adaptation to changing environments by means of the memory based thermodynamical genetic algorithm,” in Proc.7th Int. Conf. Genet. Algorithms , 1997, pp. 299 – 306. [19] R. W. Morrison, Designing Evolutionary Al gorithms for Dynamic Environments .Berlin, Germany: Springer - Verlag, 2004
Keywords
Ant colony Optimization (ACO), Ar tificial Bee Colony ( ABC), D ynamic optimization problem (DOP), dynamic shortest path routing problem (DSPRP ).