EECRPOA: energy efficient clustered routing using pelican optimization algorithm in WSNs
摘要
Energy efficiency and network life are crucial concerns in Wireless Sensor Networks (WSNs) due to the limited battery of sensor nodes. Cluster Head (CH)-based routing is a prominent strategy that aims to mitigate and tackle these overheads by dividing the network into clusters. The CHs gather data from the cluster members (CMs) and send data to the base station (BS) using the optimal path. This helps to minimize the amount of data transmission required, and the model is energy-efficient. In this paper, for the cluster head selection (CHS) and routing, a Pelican Optimization Algorithm (POA) is modelled with suitable fitness functions. The CHS algorithm is modelled using five fitness functions (FFs) named node centrality, the residual energy (RE) of the CH, the distance between cluster members (CMs) and CH, and the distance between CHs and BS. For each CH, a potential function is developed to allocate CMs. The proposed POA-based routing scheme is modelled using three fitness functions to send data to the BS. This work presented a comprehensive examination of LEACH, DEEC, BOAACO, and Airproofed. The CHS and routing algorithms are investigating their influence on network performance, encompassing energy consumption and network longevity. The simulation findings confirm that the proposed scheme significantly improves the overall efficiency and robustness of WSNs when compared to LEACH, DEEC, and BOAACO.