Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks
- 7 July 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Vol. 40 (1), 52-63
- https://doi.org/10.1109/tsmcc.2009.2023676
Abstract
In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.Keywords
This publication has 29 references indexed in Scilit:
- Hyper-learning for population-based incremental learning in dynamic environmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Stochastic shortest path with unlimited hopsInformation Processing Letters, 2009
- Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic EnvironmentsEvolutionary Computation, 2008
- A hybrid immigrants scheme for genetic algorithms in dynamic environmentsInternational Journal of Automation and Computing, 2007
- Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization ProblemsPublished by Springer Science and Business Media LLC ,2006
- Anycast Routing and Wavelength Assignment Problem on WDM NetworkIEICE Transactions on Communications, 2005
- A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environmentsSoft Computing, 2005
- Memory-based immigrants for genetic algorithms in dynamic environmentsPublished by Association for Computing Machinery (ACM) ,2005
- Population-based incremental learning with memory scheme for changing environmentsPublished by Association for Computing Machinery (ACM) ,2005
- METAHEURISTIC APPROACHES TO TRAFFIC GROOMING IN WDM OPTICAL NETWORKSInternational Journal of Computational Intelligence and Applications, 2005