Paper Title
Maximizing Network Lifetime With Adaptive Clustering in Wireless Sensor Networks

In the development of wireless sensor networks (WSNs) applications, how to organize sensor nodes into a communication network and route the sensed data from sensor nodes to a remote sink is a particular challenging problem. This has enabled the designers to create autonomous sensors, which can be deployed randomly, without human supervision, for the purpose of sensing and communicating valuable data. Many energy-efficient routing protocols are designed for WSNs based on clustering structure. Clustering provides an effective method for prolonging the lifetime of a wireless sensor network. In this paper, we propose Maximized Network Lifetime with Adaptive Clustering (MNLAC), protocol which is an extension to the LEACH protocol. In this study, cluster setup depends on the remaining energy in the entire network. When the network energy goes below a predetermined threshold, then all the clusters become invalid and new clusters are created. Cluster-head selection is based on residual energy and distance to sink as parameter to become a cluster-head (CH). MATLAB was used to simulate. The simulation data suggests that the death rate of nodes of the improved protocol was lower than the traditional one. It is concluded that the improved LEACH protocol can balance network load and extend the life-cycle of network. Keywords— Wireless Sensor Networks, Energy, LEACH, Cluster head selection.