To track a whole area, an enormous amount of sensor nodes are sprinkled throughout it in a wireless sensor network. The sensor node itself is rather small and has severely limited memory, computing power, and battery life. The wireless sensor network must diminish its energy consumption so as to prolong the system’s lifespan due to the batteries’ limited power supply. An enhanced version of the LEACH routing protocol is offered in this study as a result of a cost-efficient cluster head selection that permits the two variables distance and energy to be major factors. The obsolete LEACH routing methodology is immobile represented for all of the study fields. Clustering-based protocols can adjust energy consumption by giving each node an equal chance to turn into the cluster head. In this study, we deliberate on more modern hierarchical routing algorithms, that rely on LEACH protocol to improve their functionality and prolong wireless sensor network lifetime. Consequently, the most energy-efficient cluster head for data connection is selected depending on the energy and distance characteristics. The simulation’s findings demonstrate that, when compared to the LEACH technique presently in use, the updated approach’s choice of cluster heads is noticeably better. The core cluster head selection procedure, that in various LEACH versions causes an unanticipated breakdown for some cluster heads, can be overcome by the suggested technique. Furthermore, compared to previous iterations of the LEACH protocols, the method offers satisfactory consequences in terms of the network lifetime and energy usage.