Time scales and delay-tolerant routing protocols

ABSTRACT

Numerous routing protocols have been proposed for Delay Tolerant Networking. One class of routing protocols aims at optimizing the delivery performance by using knowledge of previous encounters for forecasting the future contacts to determine suitable next hops for a given packet. Protocols pursuing such an approach face a fundamental challenge of choosing the right protocol parameters and the right time scale for estimation. These, in turn, depend on the mobility characteristics of the mobile nodes which are likely to vary within one scenario and across different ones. We characterise this issue, which has been overlooked in this field so far, using PROPHET and MaxPROP as two representative routing protocols and derive mechanisms to dynamically and independently determine routing parameters in mobile nodes.

REFERENCES

• 1: BURGESS, J., GALLAGHER, B., JENSEN, D., AND LEVINE, B. N. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In Proc. IEEE INFOCOM (April 2006).
• 2: CHAINTREAU, A., HUI, P., CROWCROFT, J., DIOT, C., GASS, R., AND SCOTT, J. Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms. In Proc. IEEE INFOCOM (April 2006).
• 3: Frans Ekman , Ari Keränen , Jouni Karvo , Jörg Ott, Working day movement model, Proceeding of the 1st ACM SIGMOBILE workshop on Mobility models, May 26-26, 2008, Hong Kong, Hong Kong, China [doi>10.1145/1374688.1374695]
• 4: Frans Ekman , Ari Keränen , Jouni Karvo , Jörg Ott, Working day movement model, Proceeding of the 1st ACM SIGMOBILE workshop on Mobility models, May 26-26, 2008, Hong Kong, Hong Kong, China [doi>10.1145/1374688.1374695]
• 5: Thomas Karagiannis , Jean-Yves Le Boudec , Milan Vojnović, Power law and exponential decay of inter contact times between mobile devices, Proceedings of the 13th annual ACM international conference on Mobile computing and networking, September 09-14, 2007, Montréal, Québec, Canada [doi>10.1145/1287853.1287875]
• 6: KERÄNEN, A., AND OTT, J. Increasing reality for DTN protocol simulations. Technical Report, Helsinki University of Technology, Networking Laboratory, July 2007.
• 7: Jérémie Leguay_aff1n2 , Timur Friedman , Vania Conan, Evaluating MobySpace-based routing strategies in delay-tolerant networks: Research Articles, Wireless Communications & Mobile Computing, v.7 n.10, p.1171-1182, December 2007 [doi>10.1002/wcm.v7:10]
• 8: Anders Lindgren , Avri Doria , Olov Schelén, Probabilistic routing in intermittently connected networks, ACM SIGMOBILE Mobile Computing and Communications Review, v.7 n.3, July 2003 [doi>10.1145/961268.961272]
• 9: VAHDAT, A., AND BECKER, D. Epidemic routing for partially-connected ad hoc networks. Tech. Rep. CS-2000006, Duke University, April 2000.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

General Terms:
Algorithms, Design, Performance

Keywords:
delay-tolerant networking; dtn; routing; mobile ad-hoc networking; manet