Affiliation:
1. University of Massachusetts, Amherst, MA
Abstract
Many DTN routing protocols use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with limited information, so these approaches have only an
incidental
effect on such routing metrics as maximum or average delivery latency. In this paper, we present
RAPID
, an
intentional
DTN routing protocol that can optimize a specific routing metric such as worst-case delivery latency or the fraction of packets that are delivered within a deadline. The key insight is to treat DTN routing as a resource allocation problem that translates the routing metric into per-packet utilities which determine how packets should be replicated in the system.
We evaluate RAPID rigorously through a prototype of
RAPID
deployed over a vehicular DTN testbed of 40 buses and simulations based on real traces. To our knowledge, this is the first paper to report on a routing protocol deployed on a real DTN at this scale. Our results suggest that
RAPID
significantly outperforms existing routing protocols for several metrics. We also show empirically that for small loads
RAPID
is within 10% of the optimal performance.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Reference35 articles.
1. One laptop per child. http://www.laptop.org. One laptop per child. http://www.laptop.org.
2. TIER Project UC Berkeley. http://tier.cs.berkeley.edu/. TIER Project UC Berkeley. http://tier.cs.berkeley.edu/.
3. An Energy-Efficient Architecture for DTN Throwboxes
4. Surviving attacks on disruption-tolerant networks without authentication
5. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks
Cited by
348 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献