Leach Routing Algorithm Optimization Through Imperialist Approach

Routing is an important challenge in wsn due to the presence of hundreds or thousands of sensor nodes. low energy adaptive clustering hierarchy (leach) is a hierarchical routing and data dissemination protocol. leach divides a network domain into several sub-domains that are called clusters. non-uniformity of cluster distribution and cluster heads (chs) selection without considering the positions of other sensors may reduce the quality of cluster selection. sensor nodes send data packets over long distances. imperialist competitive algorithm (ica) is an optimization algorithm inspired by social phenomenon. it considers colonization process as a stage of socio-political evolution. we improve performance of the leach algorithm using imperialist approach and study its efficacy in terms of energy consumption, coverage and cluster uniformity and compare with those of the leach algorithm. selection of suitable value for radio communication radius over the network lifetime is a trade-off between connectivity and sensors energy consumption. empowering leach with ica helps to find the best location of a ch in every cluster, conserve energy significantly, increase network lifetime, and maintain network connectivity. it can significantly reduce the number of active sensors going out of range over the lifetime of a network.