Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks.

De Montfort University Open Research Archive

Show simple item record

dc.contributor.author Cheng, Hui en
dc.contributor.author Yang, Shengxiang en
dc.date.accessioned 2013-06-11T15:47:01Z
dc.date.available 2013-06-11T15:47:01Z
dc.date.issued 2009
dc.identifier.citation Cheng, H. and Yang, S. (2009) Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks. In: Proceedings of the 2009 IEEE Congress on Evolutionary Computation, Trondheim, 2009. New York: IEEE, pp. 3135-3140. en
dc.identifier.isbn 978-1-4244-2958-5
dc.identifier.uri http://hdl.handle.net/2086/8722
dc.description.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. en
dc.language.iso en en
dc.publisher IEEE en
dc.subject Ad hoc networks en
dc.subject Genetic algorithms en
dc.subject Mobile computing en
dc.subject Telecommunication network topology en
dc.title Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks. en
dc.type Article en
dc.identifier.doi http://dx.doi.org/10.1109/CEC.2009.4983340
dc.researchgroup Centre for Computational Intelligence en
dc.peerreviewed Yes en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record