Routing Using Genetic Algorithm in a Wireless Sensor Network

In this paper we probe the routing algorithm that maximizes the quality of the network. In this regard, we present various scenarios for comparisons among different routing algorithms in a wireless sensor network. Using simulations conducted in NS-2, we compare the performance of genetic algorithm (GA) to the Dijkstra algorithm, Ad hoc On-Demand Distance Vector (AODV), GA-based AODV Routing (GA-AODV), grade diffusion (GD) algorithm, directed diffusion algorithm and GA combined with the GD algorithm. We assume the presence of faulty nodes and work on finding out the performance that enhances the lifespan of the sensor network. In this regard, we have simulated routing algorithms while considering faulty nodes up to 50% of the functioning nodes. Nodes are considered to be dynamic and we assumed different mobility speeds of the nodes. Our results demonstrate that GA can be used in different network configurations as it shows a better performance in the wireless sensor network.