## 2 Related Work
Unlike the original LEACH, cluster heads (CHs) gather and broadcast data autonomously. The authors of [23] proposed Information Systems (PEGASIS), an upgraded version of LEACH. The network of nodes and sensor nodes uses PEGASIS to enable data transmission and reception from their nearby neighbors. One network node is chosen at random to serve as the leader node in each chain. Data are sent across the network by the leader node to the base station through all nodes' communication with one another. Due to an even distribution of resource consumption, which leads to less loss of energy per round in the network, PEGASIS offers a longer lifetime than LEACH. \begin{table}
\begin{tabular}{p{56.9 pt} p{113.8 pt} p{113.8 pt}} \hline \hline
**Ref** & **Protocol** & **Description \& Benefits** & **Limitations** \\ \hline \multirow{2}{*}{[19]} & M-LEACH & Multi-hop communication, Low energy consumption, self slot allocation, applicable on general applications. & Data are transmitted across numerous intermediary nodes before arriving at the final destination. \\ \hline \multirow{2}{*}{[17]} & LEACH & Considers single-hop communication, formation of cluster heads, general framework suitable to all applications, medium energy consumption. & Poor network lifetime, random CH selection, non-scalable. \\ \hline \multirow{2}{*}{[13]} & HEED & Suitable for source-driven as well as data-driven applications, adopts integrated data aggregation, in which every node collects and transmits its own data to the CH either directly or via a parent. Based on each neighbor node’s closeness to the BS, the parent selection module calculates the connection cost for each of them. Data loss and connection symmetry affect how well a communication is done. \\ \hline \multirow{2}{*}{[20]} & EKMT & K-mean clustering algorithm, cluster formation, and network overload are decreased by CH selection depending on the node’s remaining energy with no BS involvement. \\ \hline \multirow{2}{*}{[21]} & ICCHR & Chain-based hierarchical framework, low overhead, efficient data aggregation & Complex structure, difficult to operate. \\ \hline \multirow{2}{*}{[22]} & EACR-LEACH & Identifies its neighbors before forming clusters. The desired value, which is equivalent to the node degrees of CH, is used to set the greatest possible number of cluster members, reduced energy consumption. \\ \hline \multirow{2}{*}{Proposed EEDC} & Proposed EEDC & Multi-tier hierarchical clustering framework, even load distribution, subdivision technique. \\ \hline \hline \end{tabular}
\end{table} 
Table 1: _Cont._The PEGASIS protocol was altered by [PERSON] and his associates in [24] to incorporate the multi-head chain and the sink mobility idea. The sink is permitted to go along a predetermined path from one area to another. At the sojourn location (where the sink briefly resides for data collection), it waits for a sojourn time. Before the network is deployed, the sojourn location is established. A sink's sojourn time is the period of time during which it remains at a predetermined location and gathers information from the chain leaders. Compared to PEGASIS, this strategy extends the network lifetime. Another routing technique created for wireless sensor networks (WSNs) is the Hybrid Energy-Efficient Distributed Clustering (HEED). HEED uses a hybrid strategy that includes both centralized and distributed processes to balance energy consumption, extend network lifetime, and increase overall data collection efficiency in WSNs. HEED is especially efficient in circumstances with densely deployed sensor nodes because it takes advantage of node proximity to optimize cluster formation and communication. The Energy-Efficient K-Means Technique (EKMT) [20] is based on the general concept of K-mean clustering with energy as an add-on parameter.The K-Means clustering algorithm is a prominent unsupervised machine learning technique for partitioning a dataset into a fixed number of groups (k). The center of each cluster is derived as the mean of the data points within that cluster.