Abstract
Wireless sensor networks (WSNs) play a huge part in arising innovations like smart applications, the Internet of Things, and numerous self-designed, independent applications. Energy exhaustion and efficient energy consumption are principal issues in wireless sensor networks. Energy is a significant and valuable asset of sensor nodes; early energy depletion ultimately leads to a shorter network lifetime and the replacement of sensor nodes. This research proposes a novel Power-Efficient Cluster-based Routing (PECR) algorithm. It takes in clustering using K-Means, the arrangement of Cluster Heads (CHs) and a Main Cluster Head (MCH), the optimal route choice, communication in light of the energy utilization model, cluster heads, and main cluster head alternation based on residual energy and relative location. PECR decreases traffic overburden, restricts energy usage, and at last, expands the network lifetime. Sensor nodes sense the information and transmit traffic to a Base Station (BS) through a legitimate channel. The results confirm it decreases the traffic overhead and effectively utilizes the energy assets. The simulation results show that PECR's performance is 44% more improved than LEACH, EC, EECRP, and EECA algorithms. It is suitable for networks that require a stretched life.