IMMIGRANTS-ENHANCED MULTI-POPULATION GENETIC ALGORITHMS FOR DYNAMIC SHORTEST PATH ROUTING PROBLEMS IN MOBILE AD HOC NETWORKS

One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time as a result of energy conservation or node mobility. Therefore, the shortest path (SP) routing problem turns out to be a dynamic optimization problem in mobile wireless networks. In this article, we propose to use multi-population genetic algorithms (GAs) with an immigrants scheme to solve the dynamic SP routing problem in mobile ad hoc networks, which are the representative of new generation wireless networks. Two types of multi-population GAs are investigated. One is the forking GA in which a parent population continuously searches for a new optimum and a number of child populations try to exploit previously detected promising areas. The other is the shifting-balance GA in which a core population is used to exploit the best solution found and a number of colony populations are responsible for exploring different areas in the solution space. Both multi-population GAs are enhanced by an immigrants scheme to handle the dynamic environments. In the construction of the dynamic network environments, two models are proposed and investigated. One is called the general dynamics model, in which the topologies are changed because the nodes are scheduled to sleep or wake up. The other is called the worst dynamics model, in which the topologies are altered because some links on the current best shortest path are removed. Extensive experiments are conducted based on these two models. The experimental results show that the proposed multi-population GAs with immigrants enhancement can quickly adapt to the environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.

[1]  Qing Zhu,et al.  An iterative algorithm for delay-constrained minimum-cost multicasting , 1998, TNET.

[2]  Shigeyoshi Tsutsui,et al.  Forking Genetic Algorithms: GAs with Search Space Division Schemes , 1997, Evolutionary Computation.

[3]  C. Siva Ram Murthy,et al.  Ad Hoc Wireless Networks: Architectures and Protocols , 2004 .

[4]  Chung G. Kang,et al.  Shortest path routing algorithm using Hopfield neural network , 2001 .

[5]  Shengxiang Yang,et al.  A hybrid immigrants scheme for genetic algorithms in dynamic environments , 2007, Int. J. Autom. Comput..

[6]  Terence C. Fogarty,et al.  A Comparative Study of Steady State and Generational Genetic Algorithms , 1996, Evolutionary Computing, AISB Workshop.

[7]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[8]  Haesun Park,et al.  Statistical properties analysis of real world tournament selection in genetic algorithms , 2008, Applied Intelligence.

[9]  Chang Wook Ahn,et al.  A Genetic-Inspired Multicast Routing Optimization Algorithm with Bandwidth and End-to-End Delay Constraints , 2006, ICONIP.

[10]  Xin Yao,et al.  Population-Based Incremental Learning With Associative Memory for Dynamic Environments , 2008, IEEE Transactions on Evolutionary Computation.

[11]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[12]  John J. Grefenstette,et al.  Genetic Algorithms for Changing Environments , 1992, PPSN.

[13]  Shengxiang Yang,et al.  Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments , 2008, Evolutionary Computation.

[14]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

[15]  Ammar W. Mohemmed,et al.  Solving shortest path problem using particle swarm optimization , 2008, Appl. Soft Comput..

[16]  Mark Wineberg,et al.  The Shifting Balance Genetic Algorithm: improving the GA in a dynamic environment , 1999 .

[17]  Jürgen Branke,et al.  A Multi-population Approach to Dynamic Optimization Problems , 2000 .

[18]  Chai-Keong Toh,et al.  Ad hoc mobile wireless networks : protocols and systems , 2002 .

[19]  Faouzi Kamoun,et al.  Neural networks for shortest path computation and routing in computer networks , 1993, IEEE Trans. Neural Networks.

[20]  Xin Yao,et al.  Experimental study on population-based incremental learning algorithms for dynamic optimization problems , 2005, Soft Comput..

[21]  Der-Rong Din.  Anycast Routing and Wavelength Assignment Problem on WDM Network , 2005, IEICE Trans. Commun..

[22]  Shengxiang Yang,et al.  A self-organizing random immigrants genetic algorithm for dynamic optimization problems , 2007, Genetic Programming and Evolvable Machines.