Reliable Mobile Ad-Hoc Network Routing Using Firefly Algorithm
Jinil Persis, T. Paul Robert · International Journal of Intelligent Systems and Applications · 2016
Routing in Mobile Ad-hoc NETwork (MANET) is a contemporary graph problem that is solved using various shortest path search techniques.The routing algorith ms employed in modern routers use deterministic algorith ms that extract an exact nondominated set of solutions from the search space.The search efficiency of these algorithms is found to have an exponential time co mp lexity in the worst case.Moreover this problem is a mult i-objective optimization problem in nature for MA NET and it is required to consider changing topology layout.This study attempts to employ a formulat ion incorporating objectives viz., delay, hopdistance, load, cost and reliability that has significant impact on network performance.Simu lation with different random topologies has been carried out to illustrate the imp lementation of an exhaustive search algorith m and it is observed that the algorithm could handle small-scale networks limited to 15 nodes.A random search meta-heuristic that adopts the nature of firefly swarm has been proposed for larger networks to yield an appro ximated non-dominated path set.Firefly Algorith m is found to perform better than the exact algorithm in terms of scalability and computational time.