An Agile Adaptive Clustering Algorithm for Wireless Sensor Networks Considering Energy Constraint

Today wireless sensor networks are present in all aspects of human life, such as medicine, industry, transportation, and agriculture. Energy constraint and lifetime are the most significant challenges that wireless sensor networks are always facing. Clustering algorithms are suitable solutions to extend the lifetime of wireless sensor networks. This paper presents an agile adaptive clustering algorithm to increase the lifetime of wireless sensor networks. The proposed algorithm is a distributed method whereby the cluster heads are optimally replaced. The main superiority of the proposed algorithm is the overhead due to the continuous cluster heads rotation in each period is reduced because the cluster heads migrate, replicate or dissolve based on received traffic and residual energy. Besides optimally cluster heads replacement, by forming multi-hop intra-cluster and inter-cluster communications energy dissipation due to the communication of the sensors is reduced, results in a more prolonged network lifetime. The results indicate that the proposed algorithm increases the network lifetime 37.6, 38.2, 59.6, and 24.8% compared to LEACH, MOD-LEACH, SEP and DEEC algorithms, respectively.