Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, S-
dc.contributor.authorCheng, H-
dc.contributor.authorWang, F-
dc.identifier.citationIEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 40(1): 52 - 63, Jan 2010en_US
dc.descriptionThis article is posted here with permission of IEEE - Copyright @ 2010 IEEEen_US
dc.description.abstractIn 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.en_US
dc.description.sponsorshipThis work was supported by the Engineering and Physical Sciences Research Council of U.K. underGrant EP/E060722/1en_US
dc.subjectDynamic optimization problem (DOP)en_US
dc.subjectDynamic shortest path routing problem (DSPRP)en_US
dc.subjectGenetic algorithm (GA)en_US
dc.subjectImmigrants schemeen_US
dc.subjectMemory schemeen_US
dc.subjectMobile ad hoc network (MANET)en_US
dc.titleGenetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networksen_US
pubs.organisational-data/Brunel/Brunel (Active)-
pubs.organisational-data/Brunel/Brunel (Active)/School of Info. Systems, Comp & Maths-
pubs.organisational-data/Brunel/Research Centres (RG)-
pubs.organisational-data/Brunel/Research Centres (RG)/CIKM-
pubs.organisational-data/Brunel/School of Information Systems, Computing and Mathematics (RG)-
pubs.organisational-data/Brunel/School of Information Systems, Computing and Mathematics (RG)/CIKM-
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf449.12 kBAdobe PDFView/Open

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