<![CDATA[This research presents a unique energy-efficient routing strategy aimed at optimizing energy consumption and prolonging network longevity using an innovative clustering probability. Cluster-based routing algorithms facilitate versatile configurations and extend the network's lifetime until the last node ceases operation. This study introduces an energy-efficient hierarchical clustering algorithm for wireless sensor networks (WSNs), enhancing the low-energy adaptive clustering hierarchy (LEACH) algorithm. The objective of this algorithm is to reduce power consumption by the strategic selection of new cluster heads (CH) in each data transfer round and to prevent network conflicts. This objective is accomplished by employing an efficient function to identify the optimal CH nodes in each cycle, considering the current energy levels of the sensors. The suggested technique enhances the cluster formation process by utilizing the reduced distance to the base station. This study findings will enhance packet scheduling algorithms for data aggregation in WSNs to minimize the number of packets transmitted from sensors to CH. Simulation findings validate the system's efficacy in comparison to alternative compression techniques and non-compression scenarios utilized in LEACH and multi-hop LEACH.]]>
Copyrights © 2026
