Progressive energy efficient least edge computation (P-ELEC) routing protocol in wireless sensor networks

Abstract

The energy of nodes in Wireless Sensor Networks (WSNs) is usually limited, which has to be consumed economically in order to prolong the lifetime of the network. The imbalanced use degrades the sensor node energy quickly and leads to sensor voids, which further cause the routing hole problem. The routing hole problem ultimately affects network performance. To solve the routing hole problem, an Energy Efficient Least Edge Computation routing protocol (ELEC) is proposed in the literature. The simulation results show that ELEC achieves nearly double network lifetime by equal energy consumption in various parts of the network as compared to other existing routing techniques such as GRACE, LEACH, and AODV-EHA. This work presents a progressive Energy Efficient Least Edge Computation (P-ELEC) routing protocol, where a cluster head percentage is incremented periodically. Incrementing the cluster head minimizes the workload of each cluster head, and in turn, enhances the lifetime of the network. The simulation result shows the prolongation of a lifetime under various scenarios and modes of operation.