Optimal Probabilistic Cluster Head Selection for Energy Efficiency in WSN

Conventional Low Energy Adaptive Clustering Hierarchy (LEACH) is a cluster based routing protocol for Wireless Sensor Networks (WSN), which is effective in enhancing lifetime of the nodes thereby increasing the entire network life. The protocol is based on functionalities such as spatially distributed cluster formation, random selection of cluster heads, processing of data locally in the clusters and transmission of aggregated data to the base station (BS). Further, the cluster-head (CH) is selected from the member nodes (MN) from each of the cluster based on remaining energy at the node. In literature, various versions of LEACH with enhanced network life are presented. In this paper, an Efficient LEACH protocol is proposed which includes selection of CH for every round of CH selection based on results on Voronoi tessellations from stochastic geometry and remainant energy in the member node devices. In proposed protocol, a novel method is used to choose the CHs wherein the CHs and member nodes (MNs) of clusters are distributed as two independent homogeneous spatial Poisson Point Processes (PPPs). Probability of selecting the CHs and threshold is derived using results from spatial statistics. The Proposed algorithm selects optimum number of CHs leading to reduction in total energy spent in the network compared to conventional LEACH and other such algorithms. The network life is measured by number of rounds. Monte-Carlo simulations are carried out for performance analysis of LEACH, TEEN and other PPP based protocols. Furthermore, total energy dissipated in the network for each round is fairly constant throughout the network life i.e. distribution of total energy consumption by the network is fairly uniform over the rounds.