Enhanced Pelican Optimization Algorithm for Cluster Head Selection in Heterogeneous Wireless Sensor Networks

Abstract

In the research of heterogeneous wireless sensor networks, clustering is one of the most commonly used energy-saving methods. However, existing clustering methods face challenges when applied to heterogeneous wireless sensor networks, such as energy balance, node heterogeneity, algorithm efficiency, and more. Among these challenges, a well-designed clustering approach can lead to extended node lifetimes. Efficient selection of cluster heads is crucial for achieving optimal clustering. In this paper, we propose an Enhanced Pelican Optimization Algorithm for Cluster Head Selection (EPOA-CHS) to address these issues and enhance cluster head selection for optimal clustering. This method combines the Levy flight process with the traditional POA algorithm, which not only improves the optimization level of the algorithm, but also ensures the selection of the optimal cluster head. The logistic-sine chaotic mapping method is used in the population initialization, and the appropriate cluster head is selected through the new fitness function. Finally, we utilized MATLAB to simulate 100 sensor nodes within a configured area of 100 × 100 m2. These nodes were categorized into four heterogeneous scenarios: m=0,α=0, m=0.1,α=2, m=0.2,α=3, and m=0.3,α=1.5. We conducted verification for four aspects: total residual energy, network survival time, number of surviving nodes, and network throughput, across all protocols. Extensive experimental research ultimately indicates that the EPOA-CHS method outperforms the SEP, DEEC, Z-SEP, and PSO-ECSM protocols in these aspects.