Delay-Tolerant Routing Optimization Using Simulated Annealing Heuristic Algorithm in Disrupted Mobile Ad-Hoc Networks

Given the importance of reducing data latency in discrete wireless networks in critical situations, we present the combined routing protocol with a storage and forwarding approach in Throw-Box-based network topology concerning aspects such as proper relay prediction and effective buffer management. To reduce the data transfer time in the relay node selection criteria, we consider the effect of different factors: node records, end-to-end latency, the nodes' available buffer space, and information such as average speed and node movement direction. We also use artificial intelligence to perform optimal routing using the Simulated Annealing algorithm. Important common performance criteria such as average latency, delivery ratio, number of lost messages, and network overhead were used to evaluate the performance of the proposed model. The results showed that our proposed routing method has less reception delay than other routing methods and maintains maximum transmission.