Please use this identifier to cite or link to this item:
Title: Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks
Authors: Cheng, H
Yang, S
Keywords: Optimization techniques;Genetic algorithms;Particle swarm optimization;Mobile ad hoc network;Wireless mesh network;Topology dynamics;Multi-population
Issue Date: 2010
Publisher: Springer
Citation: EvoApplications 2010: Applications of Evolutionary Computing, Part I, Lecture Notes in Computer Science 6024: 562 - 571, 2010
Abstract: 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 ad hoc network (MANET), wireless mesh network, 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 in mobile wireless networks. In this paper, we propose to use multi-population GAs with immigrants scheme to solve the dynamic SP problem in MANETs which is the representative of new generation wireless networks. The experimental results show that the proposed GAs can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.
Description: Copyright @ Springer-Verlag Berlin Heidelberg 2010.
ISSN: 0302-9743
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf143.73 kBAdobe PDFView/Open

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