Evolutionary Computing Approaches for Clustering and Routing in Wireless Sensor Networks

Abstract

With proliferation of Computational Intelligence (CI), evolutionary algorithms have drawn enormous attention among researchers. Such algorithms have been studied to solve many optimization problems. Clustering and routing are two well known optimization problems which are well researched in the field of Wireless Sensor Networks (WSNs). These problems are NP-hard. Therefore, many researchers have applied meta-heuristic approaches to develop various evolutionary algorithms to solve them. In this chapter, the authors rigorously study and present various evolutionary algorithms that include Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Differential Evolution, etc. and show how these algorithms are applied to solve clustering and routing problems in WSNs. The chapter starts with an introduction of WSNs along with clustering and routing problems in WSNs accompanied by a discussion why these problems are solved by evolutionary algorithms. The authors then give an overview of various evolutionary approaches that are applied to solve clustering and routing problems. Various evolutionary algorithms are then presented towards the solution of these problems. A comparison table is also made by highlighting strengths and weaknesses of the algorithms. Finally, the authors present new directions of future research in this domain.