## 4 Proposed Efficient Monitoring System (EMS)
### The Node Categorization Component  
The categorization component's major purpose is to categorize nodes based on their effect on the entire network performance. This component handles a categorization table that stores a record of every network node and is refreshed after each encounter opportunity to accomplish this task. Each record does have a unique \(ID\) that specifies a node, as well as the most recent reputation value computed by EMS and its cooperative value \((CVM)\). The cooperative value of a node \(n\) is obtained using Equation (1). Figure 1: Influence of selfish nodes on all four performance metrics. (**a**) Package Delivery Probability; (**b**) Package Delivery Delay; (**c**) Average Energy Consumption; (**d**) Number of Dropped Packages. \[CVM_{i}=\eta\times\Delta i \tag{1}\]  
where \(\eta\) is the node efficiency factor and \(\Delta\) denotes the punctuation assigned to node \(i\) by the categorization unit. A node efficiency factor is a number that indicates how well each node performs inside the network. The categorization component employs Equations (2) and (3) to determine this value, whereas \(TRP_{m}\) is the total number of relayed packages from node \(m\), \(TFP_{m}\) is the total number of packages that node \(m\) has recently forwarded, and \(TDP_{m}\) is the number of packages that node \(m\) has previously discarded. \[y=\Sigma_{m=1}^{N}(TRP_{m}-TFP_{m}) \tag{2}\]  
\[z=\Sigma_{m=1}^{N}(TRP_{m}- TDP_{m}) \tag{3}\]  
Taking into account Equations (4) and (5), this value is adjusted to range around [0, 1]. \[\eta_{1}=\frac{y-y_{min}}{y_{max}-y_{min}} \tag{4}\]  
\[\eta_{2}=\frac{z-z_{min}}{z_{max}-z_{min}} \tag{5}\]  
The categorization component calculates the punctuation assigned to nodes \(\Delta\) depending on their classification. Based on their reputation value, nodes can be categorized into five types. To compute \(\Delta\), presume Equation (6), where \(j\) is a fixed value derived from the monitoring of a node's reputation value, which can be seen in Table 3, and \(\omega\) is a constant established by the EMS as the criterion for rewarding or penalizing nodes based on their cooperative attitude. \[\Delta_{i}=j\times\omega \tag{6}\] \begin{table}
\begin{tabular}{l l} \hline
**Notations** & **Description** \\ \hline \(CVM\) & Cooperative value given by monitoring node \\ \(RVN\) & Node reputation viewed by neighbors \\ \(RVI\) & Own reputation value of a node \\ \(\eta\) & Node efficiency factor \\ \(\Delta\) & Punctuation assigned to node \(i\) by the categorization unit. \\ \(\lambda_{1}\) & weight variable \\ \(\lambda_{2}\) & weight variable \\ \(\psi\) & Node findings in the range [0, 1] \\ \(N\) & Neighbor node \\ \(R_{v}\) & Neighbor view on node reputation \\ \(\gamma\) & Node reputation viewed by neighbors \\ \(ON_{i}\) & Neighboring nodes that can verify the behavior of node \(i\) \\ \(O_{i}\) & is the observation on selfish node \(i\) \\ \(PN_{i}\) & Punishment to node \(i\) \\ \(\omega\) & Constant established by the EMS (rewarding or penalizing nodes) \\ \(TRP_{m}\) & Total number of relayed packages \\ \(TF_{m}\) & Total number of packages that node \(m\) has recently forwarded \\ \(TDP_{m}\) & Number of packages that node \(m\) has previously discarded. \\ \hline \end{tabular}
\end{table} 
Table 2: Notations used in the Proposed Scheme. The detail of the categorization component is presented in Algorithm 1. In this algorithm, the first monitoring node determines the \(CVM\) of each node in the network. The \(CVM\) is based on two things: (1) relayed packages for nodes (2) discarding packages for nodes. After this, the reputation of each node is computed. Based on the reputation value, the node can be classified into one of the five classes. The flow chart for the categorization component is shown in Figure 3.