An efficient energy scheme for hybrid clustering wireless sensor networks

Wireless network clustering is one of the major methods which have been used in many applications for energy optimization. As there are many nodes in networks, our aim is to provide adaptive energy consumption with clustering methods. LEACH is a famous algorithm for clustering, which depends on random clustering method. In this algorithm, there are two different types of node, namely the cluster head and cluster members. Communication is provided via these cluster heads. Therefore, the LEACH algorithm achieves its main purpose by providing dynamic clustering and adaptive energy consumption. In this thesis, a new hybrid clustering algorithm is introduced, analyzed and implemented in a network area. The energy performance of the proposed method is compared with LEACH (Low Energy Adaptive Clustering Hierarchy) and SEP (Stable Elections Protocol). Cluster head selection with different constraints and methods achieves better results in cases of energy consumption.