LEACH-CKM: Low Energy Adaptive Clustering Hierarchy protocol with K-means and MTE

The requirement for operation with low energy consumption is one of the major constraints that guide the design of routing protocol in Wireless Sensor Networks (WSN) because each node is powered by a limited and generally an irreplaceable source of energy. In this context, we would like to propose a new protocol which respects the energy constraints, nodes' life duration and packets reception. This work is based on the protocol LEACH-C (Low Energy Adaptive Clustering Hierarchy) which uses a centralized architecture to select cluster-heads while involving the base station and the sensors' local information. It addresses the isolation problem of remote nodes that fail to communicate their information (coordinates and residual energies) to the base station. This results in an inefficient group formation that leads to a huge loss of data and therefore the network loses its performance. For this, we propose a solution that takes into account the remote nodes during the formation of groups. This new protocol, called LEACH-CKM, uses the K-means classification method to group the nodes and Minimum Transmission Energy routing protocol (MTE) to route information from remote nodes.