Practical Routing in Delay-Tolerant Networks
Practical Routing in Delay-Tolerant Networks
复制标题
DOI：
10.1145/1080139.1080141
复制
发表时间：
2005-08
影响因子：
7.9
通讯作者：
Evan P. C. Jones;Li Li-Li;Jakub K. Schmidtke;Paul A. S. Ward
中科院分区：
文献类型：
--
作者：
Evan P. C. Jones;Li Li-Li;Jakub K. Schmidtke;Paul A. S. Ward
延迟容忍网络 (DTN) 具有在当前网络技术无法到达的区域内互连设备的潜力。为了实现 DTN 愿景，必须在多个不可靠、间歇性连接的跃点上找到路由。在本文中，我们提出了一种实用的路由协议，该协议仅使用观察到的网络信息。我们设计了一个指标来估计每个潜在下一跳的平均等待时间。这种学习到的拓扑信息使用链路状态路由协议进行分发，其中链路状态数据包使用流行路由进行“洪泛”。每次建立连接时都会重新计算路由，从而允许消息利用不可预测的联系。如果拓扑表明连接的节点比当前节点“更接近”目的地，则转发消息。我们通过模拟证明，我们的协议提供的性能与具有网络拓扑全局知识的方案相似，但不需要这些知识。此外，与替代的流行路由相比，它需要的资源要少得多，这表明我们的方法可以更好地随着网络中消息的数量进行扩展。对于大约 100 个节点的网络来说，这种性能是通过最小的协议开销实现的。
Delay-tolerant networks (DTNs) have the potential to interconnect devices in regions that current networking technology cannot reach. To realize the DTN vision, routes must be found over multiple unreliable, intermittently-connected hops. In this paper we present a practical routing protocol that uses only observed information about the network. We designed a metric that estimates the average waiting time for each potential next hop. This learned topology information is distributed using a link-state routing protocol, where the link-state packets are "flooded" using epidemic routing. The routing is recomputed each time connections are established, allowing messages to take advantage of unpredictable contacts. A message is forwarded if the topology suggests that the connected node is "closer" to the destination than the current node. We demonstrate through simulation that our protocol provides performance similar to that of schemes that have global knowledge of the network topology, yet without requiring that knowledge. Further, it requires significantly less resources than the alternative, epidemic routing, suggesting that our approach scales better with the number of messages in the network. This performance is achieved with minimal protocol overhead for networks of approximately 100 nodes.