Skip to main content
SpringerLink
Log in

Reasonable routing in delay/disruption tolerant networks

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Delay/disruption tolerant networking (DTN) is an approach to networking where intermittent connectivity exists: it is often afforded by a store and forward technique. Depending on the capability of intermediary nodes to carry and forward messages, messages can be eventually delivered to their destination by mobile nodes with an appropriate routing protocol. To have achieved a successful delivery, most DTN routing protocols use message duplication methods. Although messages are rapidly transferred to the destination, the redundancy in the number of message copies increases rapidly. This paper presents a new routing scheme based on a stochastic process for epidemic routing. Message redundancy is efficiently reduced and the number of message copies is controlled reasonably. During the contact process of nodes in the network, the number of message copies changes, and according to the variability in the number of copies, we construct a special Markov chain, birth and death process, on the number of message copies then calculate and obtain a stationary distribution of the birth and death process. Comparing the theoretical model with the simulation we have performed we see similar results. Our method improves on time-to-live (TTL) and antipacket methods, in both redundancy and delivery success efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fall K. A delay-tolerant network architecture for challenged internets. In: Proceedings of 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 2003, 27–34

  2. Fall K, Farrell S. Dtn: an architectural retrospective. IEEE Journal on Selected Areas in Communications, 2008, 26(5): 828–836

    Article  Google Scholar 

  3. McMahon A, Farrell S. Delay- and disruption-tolerant networking. IEEE Internet Computing, 2009, 13(6): 82–87

    Article  Google Scholar 

  4. Zhang Z. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Communications Surveys and Tutorials, 2006, 8(1): 24–37

    Article  Google Scholar 

  5. Delay-tolerant networking research group. http://www.dtnrg.org/

  6. Small T, Haas Z J. Resource and performance tradeoffs in delay-tolerant wireless networks. In: Proceedings of 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. 2005, 260–267

  7. Wang Z K, Yang X Q. Birth and Death Processes and Markov Chains. Beijing: Science Press, 2006

    Google Scholar 

  8. Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University. 2000

  9. Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittently connected mobile networks: the single-copy case. IEEE/ACM Transactions on Networking, 2008, 16(1): 63–76

    Article  Google Scholar 

  10. Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittently connected mobile networks: the multiple-copy case. IEEE/ACM Transactions on Networking, 2008, 16(1): 77–90

    Article  Google Scholar 

  11. Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. 2005, 252–259

  12. Lindgren A, Doria A, Schelén O. Probabilistic routing in intermittently connected networks. In: Proceedings of 1st International Workshop on Service Assurance with Partial and Intermittent Resources. 2004, LNCS, 2004, 3126: 239–254

  13. Matsuda T, Takine T. (p,q)-epidemic routing for sparsely populated mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 2008, 26(5): 783–793

    Article  Google Scholar 

  14. Shah R C, Roy S, Jain S, Brunette W. Data mules: modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 2003, 1(2–3): 215–233

    Article  Google Scholar 

  15. Zhao W, Ammar M, Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: Proceedings of 5th ACM International Symposium on Mobile Ad hoc Networking and Computing. 2004, 187–198

  16. Tang L, Zheng Q, Liu J, Hong X. Selective message forwarding in delay tolerant networks. Mobile Networks and Applications, 2009, 14(4): 387–400

    Article  Google Scholar 

  17. Seligman M, Fall K, Mundur P. Storage routing for DTN congestion control. Wireless Communications and Mobile Computing, 2007, 7(10): 1183–1196

    Article  Google Scholar 

  18. Jain S, Fall K, Patra R. Routing in a delay tolerant network. In: Proceedings of 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 2004, 145–158

  19. Walker B D, Glenn J K, Clancy T C. Analysis of simple counting protocols for delay-tolerant networks. In: Proceedings of 2nd ACM Workshop on Challenged Networks. 2007, 19-26

  20. Groenevelt R, Nain P, Koole G. The message delay in mobile ad hoc networks. Performance Evaluation, 2005, 62(1–4): 210–228

    Google Scholar 

  21. Groenevelt R. Stochastic models for ad hoc networks. Dissertation for the Doctoral Degree. Sophia Antipolis: INRIA, 2005

    Google Scholar 

  22. Zhang X, Neglia G, Kurose J, Towsley D. Performance modeling of epidemic routing. Computer Networks, 2007, 51(10): 2867–2891

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and System Sciences, Xinjiang University, Urumqi, 830046, China

    Haizheng Yu

  2. Key Laboratory of Computer Network and Information Security, Xidian University, Xi’an, 710071, China

    Haizheng Yu & Jianfeng Ma

  3. School of Mathematical Sciences, Xinjiang Normal University, Urumqi, 830054, China

    Hong Bian

Authors
  1. Haizheng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianfeng Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hong Bian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haizheng Yu.

Additional information

Haizheng Yu is currently a Ph.D. candidate at Xidian University, China. He received his B.S. degree in mathematics and M.E. degree in computer science from Xinjiang University, Urumqi, China in 1998 and 2005, respectively. His research interests include delay tolerant networks, mobile networks and network security.

Jianfeng Ma received his B.S. degree in mathematics from Shaanxi Normal University, China in 1985. He obtained his M.E. and Ph.D. degrees in computer software and communications engineering from Xidian University, China, in 1988 and 1995, respectively. Now he is a Professor and Ph.D. supervisor in School of Computer Science at Xidian University, Xi’an, China, and the director of the Key Laboratory of Computer Networks and Information Security of Ministry of Education (China). His research interests include distributed systems, wireless and mobile computing systems, computer networks, and information and network security.

Hong Bian is an associate professor from the School of Mathematical Sciences, Xinjiang Normal University, China. She received B.S. and M.S. degrees in mathematics from Xinjiang University, China in 1998 and 2005, respectively. She received her Ph. D. degree in apply mathematics from Xiamen University in 2008. Her research interests include graph theory and network optimization.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, H., Ma, J. & Bian, H. Reasonable routing in delay/disruption tolerant networks. Front. Comput. Sci. China 5, 327–334 (2011). https://doi.org/10.1007/s11704-011-0139-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-011-0139-2

Keywords

Search

Navigation