## 3 Proposed Scheme
### Trustworthiness and QoS-Based Path Discovery and Selection Procedure  
The path discovery method of the proposed scheme works similarly to the AOMDV, which is a multipath routing method used in existing ad-hoc networks. However, there are differences in the methodologies used to discover and maintain the trusted paths. In the initial step of the process, the gateway node sends an RREQ message to each sensor node, which when received by the source node responds with multiple RREP messages to discover a trusted route. While searching for a trusted path, each node observes the behavior of its neighboring nodes to obtain their node trust value (\(NTV\)), which is obtained by observing their behavior through the promiscuous mode and is calculated using the commonly used \(PFR\)[16]. The \(PFR\) is determined by checking whether a receiving node forwards the packet and is then used as an index to detect malicious behavior, such as any malicious node arbitrarily discarding or not transmitting the received packet. To check whether normal packet forwarding is being performed, all data transmission is monitored, and the trustworthiness is calculated periodically against a set unit time. The \(PFR\) is calculated by using Equation (1) below, based on the number of packets transmitted by a node i to node jduring the set unit time and the number of packets forwarded by the node j after receiving them from i.  
\[PFR_{i,j}^{d}(t)=\frac{F_{i,j}(t)}{S_{i,j}(t)} \tag{1}\]  
\(S_{i,j}(t)\) denotes the total number of packets transmitted by node i to j during the unit time \(t\), and \(F_{i,j}(t)\) denotes the number of packets forwarded by node j after receipt from i during the unit time \(t\). \(PFR_{i,j}^{r}(t)\) denotes the trust value for node j that was recommended to node i by the neighboring node. \(PFR_{i,j}^{r}(t)\) can be calculated based on the trust values of k neighbor nodes, as given in Equation (2). \[PFR_{i,j}^{r}(t)=\frac{1}{n}\sum_{k=1}^{n}PFR_{k,j}^{d}(t) \tag{2}\]  
Using the above formula, the transmitting node i can calculate the \(NTV\) for the receiving node j through the following Equation (3). \(w_{1}\) and \(w_{2}(w_{1},w_{2}\geq 0,w_{1}+w_{2}=1)\) were assigned as weight factors for \(PFR_{i,j}^{d}(t)\) and \(PFR_{i,j}^{r}(t)\), respectively. \[NTV_{i,j}(t)=(w_{1}\times PFR_{i,j}^{d}(t))+(w_{2}\times PFR_{i,j}^{r}(t)) \tag{3}\] \begin{table}
\begin{tabular}{c c c c c c c} \hline \hline
**Mission** & **FCS Traffic** & **Data Type** & \begin{tabular}{c} **E2 EDelay** \\ **Requirement** \\ \end{tabular} & \
\begin{tabular}{c} **Time** \\ **Attribute** \\ \end{tabular} & **Priority/Precedence** & **PHB** \\ \hline \multirow{3}{*}{A} & \multicolumn{2}{c}{Collaborate C2} & \multirow{3}{*}{Voice} & \multirow{3}{*}{220 ms} & \multirow{3}{*}{Real-time} & \multirow{3}{*}{FO} & \multirow{3}{*}{Ef} \\ \cline{2-2} \cline{5-6}  & \multicolumn{2}{c}{Fire request} & & & & & \\ \cline{2-2} \cline{5-6}  & \multicolumn{2}{c}{Medical status} & & & & & \\ \hline \multirow{2}{*}{B} & \multicolumn{2}{c}{Collaborate C2} & \multirow{2}{*}{Video} & \multirow{2}{*}{220 ms} & \multirow{2}{*}{Real-time} & \multirow{2}{*}{FO, F, I, P, R} & \multirow{2}{*}{AF4} \\ \cline{2-2} \cline{5-6}  & Situation awareness & & & & & & \\ \hline \multirow{2}{*}{C} & \multirow{2}{*}{Situation awareness} & \multirow{2}{*}{Chat} & \multirow{2}{*}{300 ms} & \multirow{2}{*}{Non-Real} & \multirow{2}{*}{FO, F, I, P, R} & \multirow{2}{*}{AF3} \\ \cline{2-2} \cline{5-6}  & Damage assessment & & & & & \\ \cline{2-2} \cline{5-6}  & Sensor tasking & & & & & \\ \hline \multirow{2}{*}{E} & \multirow{2}{*}{Terrain data} & \multirow{2}{*}{Bulk data} & \multirow{2}{*}{300 ms} & \multirow{2}{*}{Non-Real} & \multirow{2}{*}{
\begin{tabular}{c} Not \\ Applicable \\ \end{tabular} } & \multirow{2}{*}{BE} \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Future combat system (FCS) traffic, Unified Capabilities (UC) applications, and QoS mapping based on priority/precedence levels.