ABSTRACT
Delay-tolerant networks (DTNs) have the potential to connect devices and areas of the world that are under-served by current networks. A critical challenge for DTNs is determining routes through the network without ever having an end-to-end connection, or even knowing which "routers" will be connected at any given time. Prior approaches have focused either on epidemic message replication or on knowledge of the connectivity schedule. The epidemic approach of replicating messages to all nodes is expensive and does not appear to scale well with increasing load. It can, however, operate without any prior network configuration. The alternatives, by requiring a priori connectivity knowledge, appear infeasible for a self-configuring network.In this paper we present a practical routing protocol that only uses observed information about the network. We designed a metric that estimates how long a message will have to wait before it can be transferred to the next hop. The topology is distributed using a link-state routing protocol, where the link-state packets are "flooded" using epidemic routing. The routing is recomputed when connections are established. Messages are exchanged if the topology suggests that a connected node is "closer" 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 a significantly smaller quantity of buffer, suggesting that our approach will scale with the number of messages in the network, where replication approaches may not.
- J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In ACM MobiCom, 1998. Google ScholarDigital Library
- Dartmouth College. The Dartmouth Wireless Trace Archive. http://cmc.cs.dartmouth.edu/data/.Google Scholar
- J. Davis, A. Fagg, and B. Levine. Wearable computers as packet transport mechanisms in highly--partitioned ad--hoc networks. In IEEE Intl. Symp. on Wearable Computers, 2001. Google ScholarDigital Library
- D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In ACM MobiCom, 2003. Google ScholarDigital Library
- R. Draves, J. Padhye, and B. Zill. Routing in multi-radio, multi-hop wireless mesh networks. In ACM MobiCom, 2004. Google ScholarDigital Library
- K. Fall. A delay--tolerant network architecture for challenged internets. In ACM SIGCOMM, 2003. Google ScholarDigital Library
- R. Handorean, C. Gill, and G.-C. Roman. Accommodating transient connectivity in ad hoc and mobile settings. Lecture Notes in Computer Science, 3001:305--322, March 2004.Google ScholarCross Ref
- B. Hull, K. Jamieson, and H. Balakrishnan. Mitigating congestion in wireless sensor networks. In ACM SenSys, 2004. Google ScholarDigital Library
- S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network. In ACM SIGCOMM, 2004. Google ScholarDigital Library
- A. Lindgren, A. Doria, and O. Schelén. Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing Communications Review, 7:19--20, July 2003. Google ScholarDigital Library
- A. Pentland, R. Fletcher, and A. Hasson. Daknet: rethinking connectivity in developing nations. IEEE Computer, 37:78--83, 2004. Google ScholarDigital Library
- C. E. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In ACM SIGCOMM, 1994. Google ScholarDigital Library
- C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. In IEEE WMCSA, 1999. Google ScholarDigital Library
- A. Rabagliati. Wizzy digital courier -- how it works.Google Scholar
- E. M. Royer and C.-K. Toh. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, 6:46--55, 1999.Google ScholarCross Ref
- S. Singh, M. Woo, and C. Raghavendra. Power-aware routing in mobile ad hoc networks. In ACM MobiCom, 1998. Google ScholarDigital Library
- L. Song, D. Kotz, R. Jain, and X. He. Evaluating location predictors with extensive wi-fi mobility data. In IEEE INFOCOM 2004, 2004.Google ScholarCross Ref
- K. Tan, Q. Zhang, and W. Zhu. Shortest path routing in partially connected ad hoc networks. In IEEE GLOBECOM, 2003.Google Scholar
- A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, Apr 2000.Google Scholar
Index Terms
- Practical routing in delay-tolerant networks
Recommendations
Routing in a delay tolerant network
SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communicationsWe formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at ...
Advanced PROPHET Routing in Delay Tolerant Network
ICCSN '09: Proceedings of the 2009 International Conference on Communication Software and NetworksTo solve routing jitter problem in PROPHET in delay tolerant network, advanced PROPHET routing is proposed in this paper. Average delivery predictabilities are used in advanced PROPHET to avoid routing jitter. Furthermore, we evaluate it through ...
Context-aware multicast routing scheme for disruption tolerant networks
PE-WASUN '06: Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networksDisruption Tolerant Networks (DTNs) are emerging solutions to networks that experience frequent network partitions and large end-to-end delays. Several schemes have been proposed for multicast routing in DTNs assuming the availability of different ...
Comments