## 2 Related Work
Authors in [25] discussed energy infrastructure and its efficiency in WSNs and evaluated routing methods from communication distribution in their study of clustering techniques. The paper proposes a basic categorization of clustering and routing techniques. There are two types of clustering classes, namely, on-demand clustering routing and pre-established clustering routing. Further, the nine clustering procedures that fall under the two categories are included in this article briefly. Furthermore, many new study directions are included in the assessment. To address energy efficiency and member rotation, CH is chosen based on the periodic rotation of CH among cluster members and remaining energy. However, the nodes' premature die-out is primarily due to their proximity to the BS. One of the significant causes for this is their inability to choose a CH [26]. The topic of this concern is resolved through LEACH-extended message passing (LEACHXMP) [27], which employs a clustering-based approach and assigns essential parameters for the selection process of CH. The base factors are the node's density, distance, and current residual energy. Orphan-LEACH (O-LEACH) is a variation of the LEACH methodology [28]. The O-LEACH technique is predicated on the LEACH procedure that is randomly selecting the cluster heads. Therefore, a few member nodes were left orphaned since they were disconnected from their corresponding CH. The idea of intermediary edge devices (gateway nodes) was proposed, which gather data from all member nodes and provide them to their respective CHs. Gateway nodes are chosen on a first-reach, first-service principle. A gateway node may be chosen regardless of its remaining battery life. O-LEACH offers more excellent coverage, connectivity, and energy efficiency compared to conventional LEACH. However, a significant drawback is the difficulty in gathering knowledge about orphan nodes. Additional challenges include delayed data transmission and excessive control overhead. Only a few researchers consider routing and clustering [15] together as a specific subjective and single issue in WSNs. The JCR algorithm shows that one way to create network architecture for data collecting in a massive WSN is via a gradient routing and back-off clock [17]. The report in [29] described the capabilities of a few clustering algorithms, and they also gave a short analysis of their pros and cons. Only seven of the most used clustering techniques in WSNs were chosen by the researchers for the study. They are S-LEACH, EECS, TL-LEACH, APTEEN, TEEN, and others. Moreover, the study contrasted various clustering algorithms in terms of network lifespan and energy use. The research of [30] presented a study on clustering methods for WSNs in a detailed manner. The study included nine standard clustering algorithms for WSNs, such as LEACH, EECS, TL-LEACH, EEUC, HEED, and so on. The major problems for these protocols during clustering were covered in the investigation. Additionally, the scientists examined various clustering methods based on various criteria, including the amount of remaining energy, cluster density, the uniform distribution of cluster head, hop-count, the time taken, and the techniques by which the clusters were formed. In [31], the routing protocols for WSNs and their various cluster architectures were discussed. Their categorization consisted of cluster head selection criteria with centralization impact (within the cluster), the number of hops among communicative nodes, and communication (intra-cluster level). The study also emphasized the difficulties in the segmentation of nodes in WSNs and elaborately presented several clustering methods. The research in [32] briefly discusses the difficulties of network lifespan extension by using clustering and routing methods compared to one another. In reviewing several routing techniques, the review looked at many challenging aspects and simplified the various routing methods.