Thesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Information Technology

Recently, more and more attention is drawn to wireless communication especially Mobile Ad Hoc Networks (MANET) for the flexibility they provide. MANETs inherit traditional wireless and mobile communications problems such as bandwidth limitation, power conservation, and quality of service (QOS) issues. Shortest path problem in MANETs is a dynamic problem because of the unpredictable MANET environment and the continuously changing topology. To compute the continuously changing shortest path with at least two additive metrics, a meta-heuristic dynamic optimization technique is required. Some evolutionary dynamic optimization techniques (EDO) have been used to compute the shortest path in MANETs, namely multi-population genetic algorithm with immigrants scheme (iMPGA). In this thesis, we propose a modified Harmony Search (HS) algorithm called dynamic optimization harmony search algorithm (DOHS), to compute the dynamic shortest path in MANETs. When compared with iMPGA, proposed DOHS outperformed with a noticeable 98.52% reduction in time and 20.25% average improvement in solution quality

Issued also as CD