Title: HARMONY SEARCH BASED ALGORITHM FOR DYNAMIC SHORTEST PATH PROBLEM IN MOBILE AD HOC NETWORKS

Year of Publication: Jul - 2013
Page Numbers: 215-224
Authors: Amir Amin, Haitham S. Hamza, Imane A. Saroit
Conference Name: The Third International Conference on Digital Information and Communication Technology and its Applications (DICTAP2013)
- Czech Republic

Abstract:


Recently, more and more attention is drawn to wireless communication especially Mobile Ad Hoc Networks (MANET) for the flexibility they provide. In MANETs mobile nodes make use of the infrastructure-less, decentralized structure to freely move without any restrictions. However, due to the limited battery life of the nodes, using the shortest path in communication is essential to conserve energy. Shortest Path (SP) problem in MANETs is a dynamic problem because of the unpredictable MANET environment and the continuously changing topology. Thus, trying to get the SP with at least two additive metrics is a NP-complete problem. In this paper, we propose a modified Harmony Search (HS) algorithm to rapidly find a high quality sub-optimal solution to the dynamic SP problem in MANETs. Our empirical results show that our modified HS can recover from topological changes and rapidly converge to good solutions before another topological change takes place.