Please use this identifier to cite or link to this item:
Title: Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks
Authors: Cheng, H
Yang, S
Keywords: ad hoc networks;Genetic algorithms;Mobile computing;Telecommunication network topology
Issue Date: 2009
Publisher: IEEE
Citation: IEEE Congress on Evolutionary Computation (CEC 2009), Trondheim: 3135 - 3140, 2009-05-18 - 2009-05-21
Abstract: In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless sensor network (WSN), etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time due to energy conservation or node mobility. Therefore, the SP problem turns out to be a dynamic optimization problem (DOP) in MANETs. In this paper, we propose to use elitism-based immigrants GA (EIGA) to solve the dynamic SP problem in MANETs. We consider MANETs as target systems because they represent new generation wireless networks. The experimental results show that the EIGA can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.
Description: This article is posted here with permission from the IEEE - Copyright @ 2009 IEEE
ISBN: 978-1-4244-2958-5
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf176.08 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.