# On the Potential of Enhancing Delay-Tolerant Routing Protocols via Age of Information
## 4 Protocol Evaluation
### Larger-Scale Simulations
\begin{table}
\begin{tabular}{c c c c c c c c c c c} \hline \hline \begin{tabular}{c} **Number of** \\ **Nodes** \\ \end{tabular} & \begin{tabular}{c} **Time** \\ **Slots** \\ \end{tabular} & \begin{tabular}{c} **Radius of** \\ **Proximity** \\ \end{tabular} & \begin{tabular}{c} **Bound** \\ **of AoI** \\ \end{tabular} & \begin{tabular}{c} **Produced** \\ **Packets** \\ \end{tabular} & \begin{tabular}{c} **Dropped** \\ **Packets** \\ \end{tabular} & \begin{tabular}{c} **Successful** \\ **Packets** \\ \end{tabular} & \begin{tabular}{c} **Remaining** \\ **Packets** \\ \end{tabular} & \begin{tabular}{c} **Execution** \\ **Time (s)** \\ \end{tabular} & \begin{tabular}{c} **Throughput** \\ **Time (s)** \\ \end{tabular} & \
\begin{tabular}{c} **Mean AoI** \\ **(Time** \\ **Units)** \\ \end{tabular} &
\begin{tabular}{c} **Max AoI** \\ **(Time** \\ **Units)** \\ \end{tabular} \\ \hline
100 & 5000 & 149 & 200 & 10,041 & 5514 & 4203 & 324 & 407.18 & 0.418 & 163.45 & 200 \\ \hline
250 & 5000 & 149 & 200 & 9955 & 8074 & 1515 & 366 & 1458.19 & 0.152 & 183.85 & 200 \\ \hline
500 & 5000 & 149 & 200 & 10,001 & 8974 & 634 & 393 & 3079.35 & 0.063 & 190.69 & 200 \\ \hline
100 & 10,000 & 149 & 200 & 19,830 & 11,151 & 8325 & 354 & 1793.91 & 0.419 & 166.15 & 200 \\ \hline
100 & 15,000 & 149 & 200 & 30,024 & 17,028 & 12,671 & 325 & 3090.86 & 0.422 & 166.93 & 200 \\ \hline
100 & 5000 & 149 & 150 & 10,004 & 5522 & 4251 & 231 & 397.36 & 0.425 & 124.1 & 150 \\ \hline
100 & 5000 & 149 & 100 & 10,012 & 5478 & 4365 & 169 & 393.27 & 0.435 & 82.42 & 100 \\ \hline
100 & 5000 & 149 & 50 & 9981 & 5931 & 3968 & 82 & 397.98 & 0.397 & 41.22 & 50 \\ \hline \hline \end{tabular}
\end{table} 
Table 10: Larger scale simulation for Modified-near-v2. \begin{table}
\begin{tabular}{c c c c c c c c c c} \hline \hline \begin{tabular}{c} **Number of** \\ **Nodes** \\ \end{tabular} & \begin{tabular}{c} **Time** \\ **Slots** \\ \end{tabular} & \begin{tabular}{c} **Radius of** \\ **Proximity** \\ \end{tabular} & \begin{tabular}{c} **Produced** \\ **Packets** \\ \end{tabular} & \begin{tabular}{c} **Successful** \\ **Packets** \\ \end{tabular} & \begin{tabular}{c} **Remaining** \\ **Packets** \\ \end{tabular} & \begin{tabular}{c} **Execution** \\ **Time (s)** \\ \end{tabular} & \begin{tabular}{c} **Throughput** \\ **Time (s)** \\ \end{tabular} & \
\begin{tabular}{c} **Mean AoI** \\ **(Time** \\ **Units)** \\ \end{tabular} &
\begin{tabular}{c} **Max AoI** \\ **(Time** \\ **Units)** \\ \end{tabular} \\ \hline
100 & 5000 & 149 & 9921 & 9870 & 51 & 324.78 & 0.994 & 27.739 & 315 \\ \hline
250 & 5000 & 149 & 10,058 & 10,015 & 43 & 1131.49 & 0.995 & 22.54 & 228 \\ \hline
500 & 5000 & 149 & 10,110 & 10,062 & 48 & 2156.49 & 0.995 & 23.63 & 296 \\ \hline
100 & 10,000 & 149 & 20,104 & 20,052 & 52 & 1276.08 & 0.997 & 28.16 & 302 \\ \hline
100 & 15000 & 149 & 29,957 & 29,911 & 46 & 2792.84 & 0.998 & 28.15 & 297 \\ \hline \hline \end{tabular}
\end{table} 
Table 11: Larger scale simulation for FRESH-neigh. \begin{table}
\begin{tabular}{c c c c c c c c c c} \hline \hline \begin{tabular}{c} **Number of** \\ **Nodes** \\ \end{tabular}  & \begin{tabular}{c} **Time** \\ **Slots** \\ \end{tabular}  & \begin{tabular}{c} **Radius of** \\ **Proximity** \\ \end{tabular}  & \begin{tabular}{c} **Bound** \\ **of AoI** \\ \end{tabular}  & \begin{tabular}{c} **Produced** \\ **Packets** \\ \end{tabular}  & \begin{tabular}{c} **Dropped** \\ **Packets** \\ \end{tabular}  & \begin{tabular}{c} **Successful** \\ **Packets** \\ \end{tabular}  & \begin{tabular}{c} **Remaining** \\ **Packets** \\ \end{tabular}  & \begin{tabular}{c} **Execution** \\ **Time (s)** \\ \end{tabular}  & \begin{tabular}{c} **Throughput** \\ **Time (s)** \\ \end{tabular}  & \ \begin{tabular}{c} **Mean AoI** \\ **(Time** \\ **Units)** \\ \end{tabular}  & \begin{tabular}{c} **Max AoI** \\ **(Time** \\ **Units)** \\ \end{tabular}