Elitism-based Genetic algorithm for Dynamic Shortest Path routing in Wireless Ad hoc Sensor Networks

The shortest path (SP) problem turns out to be a dynamic optimization problem (DOP) in Wireless ad hoc sensor networks (WASNs) ,So In this paper, we propose to use elitismbasedimmigrants GA (EIGA) to solve the dynamic SP problem in WASNs. On the basis of above, genetic algorithm (GA) isimplemented for solving the routing problem and then for better performance we propose elitism-based immigrants GA. The results show that using the elitism-based approach accelerates the speed of the base GA algorithm in routing problem

کلیدواژه ها:

WASN ، shortest path routing ، Genetic algorithm ، DOP ، elitism-based immigrants GA