The aim of this work is to propose a new routing protocol for a Delay-Tolerant Networks (DTN) called Adaptive. This protocol is based in predictable contacts concept and uses the history of meeting nodes to determine the best way to route and drop packets on network. The following performance metrics were used to evaluate the Adaptive: delivery rate, average delay and average number of hops. The Adaptive performance was then compared to the following routing protocols commonly used in the literature: First Contact, Direct Transmission, Prophet, Epidemic and Spray and Wait. The simulations were based on a vehicle DTN build from real traces collected from city buses. Two scenarios were simulated: 1) alternating transmission range of all the nodes and 2) alternating the amount of data generated on the network per user. The simulations showed that the Adaptive presented satisfactory results in both scenarios. It was able to achieve the best delivery rates when nodes had a transmission range of 300 meters or more. In addition, the Adaptive has shown that it is able to adapt well to the various data traffic intensities imposed on the network.

中文翻译：

---

自适应：车辆延迟容忍网络的自适应路由协议

这项工作的目的是为延迟容忍网络 (DTN) 提出一种称为自适应的新路由协议。该协议基于可预测的联系概念，并使用会议节点的历史来确定在网络上路由和丢弃数据包的最佳方式。以下性能指标用于评估自适应：传递率、平均延迟和平均跳数。然后将自适应性能与文献中常用的以下路由协议进行比较：First Contact、Direct Transmission、Prophet、Epidemic 和 Spray and Wait。模拟基于从城市公交车收集的真实轨迹构建的车辆 DTN。模拟了两种场景：1) 所有节点的交替传输范围和 2) 交替每个用户在网络上生成的数据量。模拟表明，自适应在两种情况下都表现出令人满意的结果。当节点的传输范围为 300 米或更远时，它能够实现最佳传输速率。此外，Adaptive 已经表明它能够很好地适应施加在网络上的各种数据流量强度。