# Estimation of the Achievable Performance of Mobile Ad Hoc Networks with Optimal Link State Routing
## 3 Results
### Evaluation Metrics and Performance Analysis in MANETs
#### 3.2.3 End-to-End Delay in Network Transmission
\begin{table}
\begin{tabular}{c c c c} \hline \hline \multirow{4}{*}{**Packet Delay, s**} & **Number of Nodes** & **Number of Nodes** & **Number of Nodes** \\  & **with 40 MHz** & **with 40 MHz** & **with 40 MHz** \\  & **Channel Bandwidth,** & **Channel Bandwidth,** & **Channel Bandwidth,** \\  & **One Branch** & **Two Branches** & **Three Branches** \\ \hline
0.1 & 35 & 66 & 96 \\ \hline
0.4 & 72 & 132 & 196 \\ \hline
1 & 106 & 210 & 314 \\ \hline \hline \end{tabular}
\end{table} 
Table 9: The effect of branching of the data transmission path on the delay in the delivery of packets in cases where all nodes send packets to the same gateway node. The calculations indicate that the branching of the network significantly affects the transmission of packets from the source node to the gateway node, allowing for a greater number of connected nodes as the number of branches increases, while providing the required delay for different classes of traffic. 5. The final scenario, in which half of the nodes transmit packets for the other half of the network nodes, i.e., each node on the path generates traffic for only one other node. Several transmission branches are symmetrical: \[T_{1}=2*\left(\frac{X}{R}\right)*\left(\left(n^{2}-n\right)/2\right),\] (12) \[T_{2}=2*\left(\frac{X}{R}\right)*\left(\frac{n}{2}\right)^{2},\] (13) \[T_{3}=2*\left(\frac{X}{R}\right)*\left(\left(\frac{\left(n-\frac{n}{3}\right)}{ 2}\right)^{2}+\left(n-\frac{n}{3}-1\right)\right),\] (14) where \(T_{1}\)--ETTD for a single branch in the network. \(T_{2}\)--ETTD for two branches in the network. \(T_{3}\)--ETTD for three branches in the network. Tables 11 and 12 demonstrate the impact of data transmission path branching on the packet delivery delay for scenarios where nodes exchange data pairwise. Comparing the last two packet transmission scenarios, it can be observed that the number of branches has a stronger influence on the maximum number of nodes in networks where nodes exchange packets among themselves. However, in the case of three branches, there is a reverse effect. This is due to the fact that in the latter case, the number of nodes that have three one-step neighbors is two instead of one as in the previous case. \begin{table}
\begin{tabular}{c c c c} \hline \hline \multirow{3}{*}{**Packet Delay, s**} & **Number of Nodes** & **Number of Nodes** & **Number of Nodes** \\  & **with 80 MHz** & **with 80 MHz** & **with 80 MHz** \\  & **Channel Bandwidth,** & **Channel Bandwidth,** & **Channel Bandwidth,** \\  & **One Branch** & **Two Branches** & **Three Branches** \\ \hline
0.1 & 52 & 110 & 158 \\ \hline
0.4 & 108 & 212 & 315 \\ \hline
1 & 170 & 336 & 653 \\ \hline \hline \end{tabular}
\end{table} 
Table 10: The effect of branching of the data transmission path on the delay in the delivery of packets in cases where all nodes send packets to the same gateway node. \begin{table}
\begin{tabular}{c c c c} \hline \hline \multirow{3}{*}{**Packet Delay, s**} & **Number of Nodes** & **Number of Nodes** & **Number of Nodes** \\  & **with 40 MHz** & **with 40 MHz** & **with 40 MHz** \\  & **Channel Bandwidth,** & **Channel Bandwidth,** & **Channel Bandwidth,** \\  & **One Branch** & **Two Branches** & **Three Branches** \\ \hline
0.1 & 46 & 68 & 86 \\ \hline
0.4 & 96 & 140 & 176 \\ \hline
1 & 152 & 220 & 292 \\ \hline \hline \end{tabular}
\end{table} 
Table 11: The dependence of the influence of branching of the data transmission path on the delay in the delivery of packets for 40 MHz channels. It should be noted that the increase in the number of branches in a node is limited by the network parameters, such as having two or three neighboring one-hop nodes for each node. Therefore, in this calculation, it is considered that only three branches will lead to the \"central\" node. In a different data transmission path topology, it is important to consider that if each node has three one-hop neighbors, it will result in the end nodes being in close proximity to each other, which limits the size of the network.