Asymmetric Spray and Multi-forwarding for Delay Tolerant Networks

  • Yue Cao
  • Haitham Cruickshank
  • Zhili Sun
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 71)


The framework of Delay Tolerant Networks (DTNs) has received an extensive attention from academic community because of its application ranging from Wireless Sensor Networks (WSNs) to interplanetary networks. It has a promising future in military affairs, scientific research and exploration. Due to the characteristic of long delay, intermittent connectivity and limited network resource, the traditional routing algorithms do not perform well in DTNs. In this paper, our proposed algorithm is based on an asymmetric spray mechanism combining with the concept of message classes. For each message class, a corresponding forwarding queue is designed and these queues are scheduled according to their priorities. Together with other designed assistant functions, our proposed algorithm outperforms other state of the art algorithms in terms of delivery ratio, overhead ratio, average latency as well as energy consumption.


Delay Tolerant Networks Routing Algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fall, K., Farrell, S.: DTN: an Architectural Retrospective. IEEE Journal on Selected Areas in Commun. 26(5), 828–836 (2008)CrossRefGoogle Scholar
  2. 2.
    Jain, S., Fall, K., Patra, R.: Routing in a Delay Tolerant Network. In: SIGCOMM 2004, Portland (September 2004)Google Scholar
  3. 3.
    Daly, E., Haahr, M.: Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs. In: MOBIHOC, Montréal, Québec, Canada (2007)Google Scholar
  4. 4.
    Musolesi, M., Masclo, C.: CAR: Context Aware Adaptive Routing for Delay Tolerant Mobile Networks. IEEE Transaction on Mobile computing 8(2), 246–260 (2009)CrossRefGoogle Scholar
  5. 5.
    Grossglauser, M.: Tse DNC.: Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking 10(4), 477–486 (2002)CrossRefGoogle Scholar
  6. 6.
    Becker, D.: Epidemic routing for partially connected ad hoc networks. Technique Report, CS-2000-06, Department of Computer Science, Duke University, Durham, NC (2000)Google Scholar
  7. 7.
    Spyropoulos, T., Psounis, K., Raghavendra, C.: Effcient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking 16(1), 77–90 (2008)CrossRefGoogle Scholar
  8. 8.
    Lindgren, A., Doria, A., Schelén, O.: Probabilistic Routing in Intermittently Connected Networks. In: SIGMOBILE Mobile Computing Communications Review (July 2003)Google Scholar
  9. 9.
    Burgess, J., Gallagher, B., Jensen, D.: MaxProp: Routig for Vehicle-Based Disruption Tolerant Networking. In: IEEE INFOCOM 2006, Barcelona (April 2006)Google Scholar
  10. 10.
    Spyropoulos T., Psounis, K., Raghavendra, C.: Spray and Focus: Effcient mobility Assisted routing for Heterogeneous and Correlated Mobility. In: PerCOM, Newyork (March 2007)Google Scholar
  11. 11.

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2011

Authors and Affiliations

  • Yue Cao
    • 1
  • Haitham Cruickshank
    • 1
  • Zhili Sun
    • 1
  1. 1.Centre for Communication System ResearchUniversity of SurreyGuildfordUK

Personalised recommendations