Ad hoc network is divided into subcategories in which wireless sensor network (WSN) is one of them, which include several small devices known as sensor nodes (SNs) connected to base stations (BSs). The network lifetime is one of the most vital features as a trustworthy transmission. The low energy adaptive clustering hierarchy (LEACH) is one of the prominent protocols for deploying in the WSN that depends upon a procedure of clustering. Nevertheless, as cluster heads (CHs) share information with a BS openly irrespective of their interior distance, a maximum energy is utilized if the distance between them is too long, which alternatively minimizes the lifetime of the network. To cope with these challenges, various extensions of the LEACH protocol have been designed that send data in two ways, i.e., either in a single hop or multi hop. However, most of these extensions bring extra computational complexity for CHs due to the usage of residual energies. This study proposes an adaptive routing multi-hop LEACH (WM-LEACH) that would minimize the utilization of energy and augment the entire lifetime of the WSN. This rationale of the WM-LEACH is examined in the MATLAB simulator and the obtained outcomes are associated with other routing protocols in terms of network lifetime.
