## 4 The Proposed Reputation Management System
### Reputation Manager  
The reputation manager computes the reputation values of a node from the information it obtains from the monitor. Nodes generally consume more energy when they transmit data packets than routing control packets. The proposed reputation model focuses more on the number of data packets a node transmits for other nodes than the number of routing control packets it transmits. To compute the reputation of a node, we evaluate the information derived from the monitor in two phases. \begin{table}
\begin{tabular}{c l} \hline
**Packet Variable** & **Packet Count Details** \\ \hline \(P_{T}\) & Packets transmitted by the target node. \\ \(P_{Tdata}\) & Data packets transmitted by the target node. \\ \(P_{Tdata-self}\) & Transmitted data packets generated by the target node. \\ \(P_{Tdata-others}\) & Transmitted data packets generated by other nodes. \\ \(P_{Tcontrol}\) & Routing control packets transmitted by the target node. \\ \(P_{Tctrl-self}\) & Transmitted routing control packets generated by the target node. \\ \(P_{Tctrl-others}\) & Transmitted routing control packets generated by other nodes. \\ \(P_{Rdata}\) & Data packets received from the target node. \\ \(P_{Rdata-self}\) & Data packets received from the target node generated by itself. \\ \(P_{Rdata-others}\) & Data packets received from the target node generated by other nodes. \\ \(P_{Rcontrol}\) & Control packets received from the target node. \\ \(P_{Retrl-self}\) & Received routing control packets generated by the target node. \\ \(P_{Retrl-others}\) & Received routing control packets from the target node generated by other nodes. \\ \hline \end{tabular}
\end{table} 
Table 1: Summary of monitoring details stored in the node table. Figure 5: Filtering of received packets. Let \(\hbar_{\bf 1}\) represent the reputation of the node based on the data packets it transmits for others, and let \(\psi_{\bf 1}\) represent the reputation of the node based on the routing control packets it transmits for other nodes. We computed \(\hbar_{\bf 1}\) as shown in Equation (1):  
\[\hbar_{\bf 1}{=}P_{Tdata-others}/(P_{Tdata-self}+P_{Tdata-others}) \tag{1}\]  
Similarly, \(\psi_{\bf 1}\) is given as:  
\[\psi_{\bf 1}{=}P_{Tctrl-others}/(P_{Tctrl-self}+P_{Tctrl-others}) \tag{2}\]  
To compute the reputation of a node based on the number of data and routing control packets it receives from the target node, which was generated by other nodes, let \(\hbar_{\bf 2}\) represent the reputation value based on received data packets generated by other nodes and let \(\psi_{\bf 2}\) represent the reputation value based on received routing control packets generated by other nodes. We compute \(\hbar_{\bf 2}\) and \(\psi_{\bf 2}\) as follows:  
\[\hbar_{\bf 2}{=} P_{Rdata-others}/(P_{Rdata-self}+P_{Rdata-others}) \tag{3}\] \[\psi_{\bf 2}{=} P_{Rctrl-others}/(P_{Rctrl-others}+P_{Rctrl-self}) \tag{4}\]  
The variables employed in computing the reputations \(\hbar_{\bf 1}\), \(\psi_{\bf 1}\), \(\hbar_{\bf 2}\) and \(\psi_{\bf 2}\) in Equations (1)-(4) are presented in Table 2.  
To compute the final reputation of a node in terms of data packets it has transmitted for other nodes, we combine \(\hbar_{\bf 1}\) and \(\hbar_{\bf 2}\). Thus, the final reputation of a monitored node in terms of data packets it has transmitted for other nodes is given as:  
\[\hbar_{\bf data}=\quad\hbar_{1}+\quad\hbar_{\bf 2} \tag{5}\]  
Similarly, the final reputation of the nodes based on the number of routing control packets it has transmitted for other nodes is given by:  
\[\psi_{\bf control}{=}\quad\psi_{\bf 1}+\quad\psi_{\bf 2} \tag{6}\]