Leapfrog: Optimal Opportunistic Routing in Probabilistically Contacted Delay Tolerant Networks

Journal of Computer Science and Technology

Volumn 24, Issue 5, 2009, Pages 975-986

  Xiao, Ming Jun ^a   Huang, Liu Sheng ^a   Dong, Qun Feng ^a   Liu, An ^a   Yang, Zhen Guo ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

DTN (delay tolerant network); Opportunistic; Routing

Indexed keywords

COMPUTATION OVERHEADS; DELAY TOLERANT NETWORKS; DELIVERY DELAY; DIJKSTRA ALGORITHMS; DTN (DELAY-TOLERANT NETWORK); EXTENSIVE SIMULATIONS; ITERATIVE COMPUTATION; LONG LASTING; LOW DELAY; MESSAGE ROUTING; OPPORTUNISTIC; OPPORTUNISTIC ROUTING; POWER MANAGEMENTS; ROUTE MESSAGES; ROUTING; ROUTING SELECTION; ROUTING STRATEGIES;

BLOCK CODES; ENERGY MANAGEMENT; OPTIMIZATION;

ROUTING ALGORITHMS;

EID: 70349603588     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-009-9272-x     Document Type: Article

References (18)

1. Delay Tolerant Network Research Group. April 28, 2009, http://www.dtnrg.org/.
2. Burgess J, Gallagher B, Jensen D et al. MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proc. IEEE INFOCOM 2006, Barcelona, Spain, April 23-29, 2006, pp.1-11.
3. Burns B, Brock O, Levine B N. MV routing and capacity building in disruption tolerant networks. In Proc. IEEE IN-FOCOM 2005, Miami, USA, March 13-17, 2005, pp.398-408. (Pubitemid 41390837)
4. V Conan J Leguay T Friedman 2008 Fixed point opportunistic routing in delay tolerant networks IEEE Journal on Selected Areas in Communications 26 5 773 782 10.1109/JSAC.2008.080604 (Pubitemid 351780195)
5. Hui P, Crowcroft C, Yoneki E. BUBBLE rap: Social-based forwarding in delay tolerant networks. In Proc. ACM MobiHoc 2008, Hong Kong, China, May 27{30, 2008, pp.241-250.
6. Jain S, Fall K, Patra R. Routing in a delay tolerant network. In Proc. ACM SIGCOMM 2004, Portland, USA, August 30-September 3, 2004, pp.145-158.
7. Jeremie L, Timur F, Vania C. Evaluating mobility pattern space routing for DTNs. In Proc. IEEE INFOCOM 2006, Barcelona, Spain, April 23-29, 2006, pp.1-10.
8. A Lindgren A Doria O Schelen 2004 Probabilistic routing in intermittently connected networks Lecture Notes in Computer Science 3126 1 239 254
9. Cong Liu, Jie Wu. Routing in a cyclic MobiSpace. In Proc. ACM MobiHoc 2008, Hong Kong, China, May 27-30, 2008, pp.351-360.
10. Spyropoulos T, Psounis K, Raghavendra C. Spray and Wait: An efficient routing scheme for intermittently connected mobile networks. In Proc. ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN) 2005, Philadelphia, USA, August 22-26, 2005, pp.252-259.
11. Vahdate A, Becker D. Epidemic routing for partially-connected ad hoc networks. Technical Report CS-2000-06, Duke University, June 2000.
12. Balazinska M, Castro P. Characterizing mobility and network usage in a corporate wireless local-area network. In Proc. ACM MobiSys 2003, San Francisco, USA, May 5-8, 2003, pp.303-316.
13. Henderson T, Kotz D, Abyzov I. The changing usage of a mature campus-wide wireless network. In Proc. ACM MobiCom 2004, Philadelphia, USA, September 26-October 1, 2004, pp.187-201.
14. CRAWDAD data set. April 28, 2009, http://crawdad.cs.dartmouth.edu/.
15. Srinivasan V, Motani M, Ooi W T. Analysis and implications of student contact patterns derived from campus schedules. In Proc. ACM MobiCom 2006, Los Angeles, USA, September 24-29, 2006, pp.86-97.
16. Tariq M M B, Ammar M, Zegura E. Message ferry route design for sparse ad hoc networks with mobile nodes. In Proc. ACM MobiHoc 2006, Florence, Italy, May 22-26, 2006, pp.37-48.
17. Zhao W, Ammar M, Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proc. ACM MobiHoc 2004, Tokyo, Japan, May 24-26, 2004, pp.187-198.
18. Balasubramanian A, Levine B N, Venkataramani A. DTN routing as a resource allocation problem. In Proc. ACM SIGCOMM 2007, Kyoto, Japan, August 27-31, 2007, pp.373-384.