EVOLUTIONARY ALGORITHMS FOR CLUSTERING IN WIRELESS SENSOR NETWORKS

Recent studies have shown that hierarchical routing is one of the best approaches for routing in wireless sensor networks (wsn). in typical hierarchical routing techniques, the network divided into regions (a.k.a. clusters); each cluster is then managed as a standalone network with its cluster head serving as the node of communication coordination and data collection. accordingly, nodes across the network can save their energy when attempting to communicate with the other nodes far across the network. several hierarchical routing techniques have been proposed over the last few years, despite the fact that most of these algorithms are fundamentally similar. due to the nature and complexity of hierarchical routing, evolutionary optimization algorithms have been used recently to perform clustering and routing techniques. in this paper, we present, to the best of our knowledge, one of the first surveys on the use of evolutionary algorithms (ea) for clustering in hierarchical routing in wsns. categorization and classification of the various clustering techniques are presented and used to understand the existing algorithms. a comparison among these techniques is also presented in this work.