Routing in a delay tolerant network

Computer Communication Review

Volumn 34, Issue 4, 2004, Pages 145-157

  Jain, Sushant ^a   Fall, Kevin ^b   Patra, Rabin ^c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b INTEL RESEARCH   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Delay Tolerant Network; Routing

Indexed keywords

DELAY TOLERANT NETWORK (DTN); ROUTING; ROUTING ALGORITHMS; ROUTING PROBLEMS;

ALGORITHMS; CONSTRAINT THEORY; DELAY CIRCUITS; FAULT TOLERANT COMPUTER SYSTEMS; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

ROUTERS;

EID: 21844451437     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1030194.1015484     Document Type: Conference Paper

References (25)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. J. Alonso and K. Fall. A Linear Programming Formulation of Flows over Time with Piecewise Constant Capacity and Transit Times. Technical Report IRB-TR-03-007, Intel Research Berkeley, July 2003.
3. AMSAT. http://www.amsat.org/.
4. 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, Aug. 1998.
5. X. Chen and A. L. Murphy. Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In Workshop on Principles of Mobile Computing, August 2001.
6. CPLEX: Linear Programming Solver, http://www.ilog.com/.
7. DTN Research Group. http://www.dtnrg.org/.
8. K. Fall. A Delay-Tolerant Network Architecture for Challenged Internets. In ACM SIGCOMM, Aug. 2003.
9. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
10. S. Gao. Routing Problems in Stochastic Time-Dependent Networks with Applications in Dynamic Traffic Assignment. Master's thesis, MIT, 2002.
11. P. Honeymoon and S. Bellovin. PATHALIAS: The Care and Feeding of Relative Address. In USENIX Conference, 1986.
12. B. Hoppe and E. Tardos. The Quickest Transshipment Problem. In SODA, Jan. 1996.
13. P. Juang, H. Oki, Y. Wang, M. Margaret, P. Li-Shiuan, and R. Daniel. Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet. In ASPLOS-X, October 2002.
14. B. Kotnyek. An Annotated Overview of Dynamic Network Flows. Technical Report RR-4936, INRIA, Sept. 2003.
15. J. A. Magliacane. PREDICT: Satellite Tracking Software. http://www.qsl.net/kd2bd/predict.html/.
16. M. K. Marina and S. R. Das. On-demand Multipath Distance Vector Routing in Ad Hoc Networks. In IEEE ICNP, Nov. 2001.
17. D. Niculescu and B. Nath. Trajectory based Forwarding and its Applications. In ACM Mobicom, 2003.
18. R. Ogier. Minimum-delay Routing in Continuous-time Dynamic Networks with Piecewise-constant Capacities. Networks, 18:303-318, 1988.
19. A. Orda and R. Rom. Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length. Journal of the ACM, 37(3), 1990.
20. A. Pentland, R. Fletcher, and A. Hasson. DakNet: Rethinking Connectivity in Developing Nations. In IEEE Computer, Jan. 2004.
21. S. Saroiu, K. Gummadi, R. Dunn, S. Gribble, and H. Levy. An Analysis of Internet Content Delivery Systems. In OSDI, Dec. 2002.
22. R. C. Shah, S. Roy, S. Jain, and W. Brunette. Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks. In IEEE SNPA, May 2003.
23. TIER Project. http://tier.cs.berkeley.edu/.
24. A. Vahdat and D. Becker. Epidemic Routing for Partially-connected Ad hoc Networks. Technical Report CS-2000-06, Duke University, July 2000.
25. Wizzy Project. http://www.wizzy.org.za/.