# Unsupervised Learning-Based WSN Clustering for Efficient Environmental Pollution Monitoring
## 5 Results and Discussion
### Findings and Result Conclusions  
In all different simulated scenarios, we calculated the number of dead nodes per round, and the average remaining energy for all nodes per round in both static and dynamic contexts. The following energy consumption model was used to compute the required energy for each cluster head to withstand and stay alive during the simulation and die immediately after the final dead node in their clusters [5]:  
\[E_{Tx}(k,d)=\left\{ \begin{array}{ll}E_{elec}\times k+\epsilon_{fs}\times k \times d^{2},\ d<d_{0}\\ E_{elec}\times k+\epsilon_{mp}\times k\times d^{4},\ d\geq d_{0}\end{array} \right. \tag{2}\]  
\[E_{Rx}(k)=E_{elec}*k \tag{3}\]  
where E_Tx is energy consumption by transmission, E_Rx is energy consumption by the receiver, E_elec is the energy required to process 1-bit of data, and k is the size of the packet. \(\epsilon\)_fs and \(\epsilon\)_mp denote the energy needed to transmit 1-bit data while having an acceptable bit error rate in the case of the free space model and multipath model, respectively. d is the distance of transmission and \(d_{0}\) is the threshold, calculated as follows:  
\[d_{0}=\sqrt{\frac{\epsilon_{fs}}{\epsilon_{mp}}} \tag{4}\] \begin{table}
\begin{tabular}{c c} \hline \hline
**K-LEACH Parameters** & **Values** \\ \hline Network Size & 100 m \(\times\) 100 m \\ \hline Location of Sink & \((50,50)\) \\ \hline Number of Nodes & 132 nodes \\ \hline Number of Cluster Head & 5 cluster Head \\ \hline Total Energy in K-LEACH & 13.2 J \\ \hline Total Energy in LEACH & 14.2209 J \\ \hline Excess Energy (ee) & 1.0209 J \\ \hline ETX (Energy consumed in the transmission of data) & 50 nJ \\ \hline ERX (Energy consumed in the reception of data) & 50 nJ \\ \hline Efs (Energy consumed by the amplifier to transmit at a short distance) & 10 pJ/bit/m\({}^{2}\) \\ \hline Emp (Energy consumed by the amplifier to transmit at a long distance) & 0.0013 pJ/bit/m\({}^{4}\) \\ \hline EDA (Data aggregation) & 5 nJ/bit/signal \\ \hline Number of Rounds & 3000 \\ \hline Packets sent by the normal nodes & 700–850 byte \\ \hline Packets sent by cluster-head nodes & 200–3500 byte \\ \hline \hline \end{tabular}
\end{table} 
Table 1: K-LEACH parameter settings. \begin{table}
\begin{tabular}{c c c} \hline \hline  & **Normal Nodes** & **CH Nodes** \\ \hline
**Low pollutant concentration state** & 700–750 byte & 2000–2500 byte \\ \hline
**Medium pollutant concentration state** & 750–800 byte & 2500–3000 byte \\ \hline
**High pollutant concentration state** & 800–850 byte & 3000–3500 byte \\ \hline
**Mix pollutant concentration state** & 700–850 byte & 2000–3500 byte \\ \hline \hline \end{tabular}
\end{table} 
Table 2: Number of packets for each state of the pollutant concentration states. Figure 6 clarifies the average residual energy of our modified K-LEACH algorithm compared to the default (Classical) K-LEACH algorithm before pollution measurements. Additionally, we tested our modified K-LEACH algorithm with the classical K-LEACH algorithm to check the lifetime of the nodes. Figure 7 presents the number of dead nodes of our modified K-LEACH algorithm compared to the default (classical) K-LEACH algorithm before pollution measurements. Table 3 explores the gap between nodes' lifetime as the first die in the highest round number in our modified K-LEACH algorithm compared to the classical K-LEACH, according to the readings taken. Figure 6: The average residual energy of the modified and classical K-LEACH algorithms. Figure 7: Number of dead nodes of the modified and classical K-LEACH algorithms. It can be noticed from Table 3, along with Figures 6 and 7 that our modified K-LEACH algorithm considerably fits our discussion about its behavior in prolonging network lifetime as the first node dies at the highest number of rounds compared to the classical K-LEACH. The enhanced performance of the K-LEACH routing protocols on the network can be inferred from Figures 8 and 9.