STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks
ISWC '01 Proceedings of the 5th IEEE International Symposium on Wearable Computers
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Hardware design experiences in ZebraNet
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Bridging the digital divide: storage media + postal network = generic high-bandwidth communication
ACM Transactions on Storage (TOS)
Using redundancy to cope with failures in a delay tolerant network
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Practical routing in delay-tolerant networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Resource and performance tradeoffs in delay-tolerant wireless networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing in a mobility pattern space
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A survey of practical issues in underwater networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
CarTel: a distributed mobile sensor computing system
Proceedings of the 4th international conference on Embedded networked sensor systems
Surviving attacks on disruption-tolerant networks without authentication
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Modelling data dissemination in opportunistic networks
Proceedings of the third ACM workshop on Challenged networks
Performance modeling of epidemic routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
Price: Hybrid geographic and co-based forwarding in delay-tolerant networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Communication capacity-based message exchange mechanism for delay-tolerant networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scoop: decentralized and opportunistic multicasting of information streams
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Practical routing in a cyclic MobiSpace
IEEE/ACM Transactions on Networking (TON)
A density-aware routing scheme in delay tolerant networks
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Mobile Networks and Applications
A reinforcement learning-based routing for delay tolerant networks
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
Routing protocols for disruption-tolerant networks (DTNs) 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, and so these approaches have only an incidental effect on such routing metrics as maximum or average delivery delay. In this paper, we present RAPID, an intentional DTN routing protocol that can optimize a specific routing metric such as the worst-case delivery delay 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 that determine how packets should be replicated in the system. We evaluate RAPID rigorously through a prototype 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 outdoor DTN. 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.