Clustering for Lifetime Enhancement in Wireless Sensor Networks

Abstract

Wireless sensor networks face challenges such as energy consumption, scalability, security vulnerabilities, and communication range limitations, impacting their overall performance and reliability. To resolve these problems, energy-efficient protocols and adaptive sleep modes are implemented in wireless sensor networks (WSNs). Actually, LEACH clustering is widely regarded as one of the primary strategies to extend the lifetime of WSNs. However, clustering does not always guarantee optimal performance. In this paper, we demonstrate that clustering effectiveness is contingent on specific conditions related to several key parameters, including cluster density and the distance of nodes from the base station. Our research presents a mathematically validated analysis, supported by simulation results, that illustrates how clustering can enhance WSN performance, particularly in terms of network lifetime, throughput, and the timing of the first, middle, and last node deaths. Our findings indicate that LEACH is inefficient when nodes are within 80 m of the base station. Furthermore, clusters’ densities are related directly to the distance to the base station. Specifically, for distances less than 80 m, nodes should send their data individually; for distances between 83 and 123 m, a cluster density of two is most effective; and for distances between 123 and 149 m, the optimal density increases to three nodes.