Advertisement

E-Scheme in Delay-Tolerant Networks

  • Zhi-Ting Lin
  • Yu-Gui Qu
  • Qing-Hua Wang
  • Bao-Hua Zhao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5297)

Abstract

Delay Tolerant Networks (DTNs) are characterized by very long delay paths and frequent network partitions. In this paper, a novel E-Scheme is proposed which can be utilized by most of the existing routing approaches that employ the ‘probability to deliver’ metric. Providing there are n opportunities, the E-Scheme is to let the first (n − 1)/e opportunities go by (except for encountering the destination of messages) and then accept the first one to appear that is better than all of those. Meanwhile a probabilistic metric, called Two-Hop (TH) delivery predictability value, is presented here according to the small world theory. Our scheme has been evaluated using some existing approaches as well as the TH delivery predictability value and been shown to exhibit excellent performances.

Keywords

Delay-Tolerant Network E-Scheme routing approach 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chaintreau, A., Jui, P., Crowcroft, J., Diot, C., Gass, R., Scott, J.: Impact of human mobility on the design of opportunistic forwarding algorithms. In: Proceedings of IEEE INFOCOM, Barcelona, ES (2006)Google Scholar
  2. 2.
    Song, L., Kotz, D.: Evaluating opportunistic routing protocols with large realistic contact traces. In: ACM MobiCom workshop on Challenged Networks (2007)Google Scholar
  3. 3.
    Chen, L.-J., Yu, C.-H., Sun, T., Chen, Y.-C.: A hybrid routing approach for opportunistic networks. In: CHANTS 2006: Proceedings of the 2006 SIGCOMM workshop on Challenged networks, pp. 213–220 (2006)Google Scholar
  4. 4.
    Elizabeth, D., Mads, H.: Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs. In: MobiHoc 2007, pp. 32–40 (2007)Google Scholar
  5. 5.
    Muhammad, A., Robert, S.: The Impact of the Mobility Model on Delay Tolerant Networking Performance Analysis. In: Proceedings of the 40th Annual Simulation Symposium (2007)Google Scholar
  6. 6.
    Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Technical Report CS-2000-06, Duke University (2000)Google Scholar
  7. 7.
    Hui, P., Crowcroft, J.: Bubble rap: Forwarding insmall world dtns in ever decreasing circles. Technical Report UCAM-CL-TR-684, University of Cambridge (2007)Google Scholar
  8. 8.
    Fall, K.: A Delay-Tolerant Network Architecture for Challenged Internets. SIGCOMM (2003)Google Scholar
  9. 9.
    Lindgren, A., Doria, A.: Probabilistic routing protocol for intermittently connected networks. Technical report, draft-lindgren-dtnrg-prophet-01.txt, IETF Internet draft (2005)Google Scholar
  10. 10.
    Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review 7(3), 19–20 (2003)CrossRefGoogle Scholar
  11. 11.
    Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: Maxprop: Routing for vehicle-based disruption-tolerant networking. In: Proc. Infocom 2006, vol. 4, pp. 1688–1698. IEEE, Los Alamitos (2006)Google Scholar
  12. 12.
    Dubois-Ferriere, H., GrossGlauser, M., And Verrerli, M.: Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In: Proc. MobiHoc 2003, pp. 257–266. ACM Press, New York (2003)Google Scholar
  13. 13.
    Musolesi, M., Hailes, S., Masxolo, C.: Adaptive routing for intermittently connected mobile ad hoc networks. In: Proc. WoWMoM 2005, pp. 183–189. IEEE, Los Alamitos (2005)Google Scholar
  14. 14.
    Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. In: SIGMOBILE Mobile Computing Communications Review (2003)Google Scholar
  15. 15.
    Chen, X., Murphy, A.L.: Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In: Workshop on Principles of Mobile Computing (August 2001)Google Scholar
  16. 16.
    Ross, S.M.: Introduction to Probability Models. 9. Elsevier, Amsterdam (2007)Google Scholar
  17. 17.
    Watts, D.J.: Small Worlds.: the dynamics of networks between order and randomness. Princeton University Press, Chichester (1999)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Zhi-Ting Lin
    • 1
  • Yu-Gui Qu
    • 1
  • Qing-Hua Wang
    • 1
  • Bao-Hua Zhao
    • 2
    • 3
  1. 1.Dept. of Electronic Engineering and Information ScienceUniversity of Science and Technology of ChinaAnhuiChina
  2. 2.Dept. of Computer ScienceUniversity of Science and Technology of ChinaAnhuiChina
  3. 3.State Key Laboratory of Networking and Switching TechnologyBeijingChina

Personalised recommendations