Skip to main content
SpringerLink
Log in

Memory Forwarding Algorithm in Multiple Communities Delay Tolerant Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The routing is one of the key problems in delay tolerant networks (DTNs) because the source and destination often could not find a contemporaneous end-to-end path. In this paper, with the objective of reducing the number of copies, we propose two corresponding routings including a memory forwarding algorithm (MFA) and an extended memory forwarding algorithm (EMFA) for the specific type of node placement in DTNs where the nodes are randomly located and moved at different communities. The main idea of our algorithms are that the node copies a packet to an encountering node or not based on the relationship of their and the destination’s community locations calculated from the memory table, and they are designed for small and moderate number of communities respectively. We then state and analyze the expected number of copies of our algorithms. Simulation results reveal that MFA and EMFA can apparently decrease the number of copies and achieve comparable delivery delays compared with the classic multi-copy routings.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Fall, K. (2003). A delay-tolerant network architecture for challenged Internets. In Proceedings of the ACM special interest group on data communication, pp. 27–34.

  2. Pentland, A., Fletcher, R., & Hasson, A. (2004). Daknet: Rethinking connectivity in developing nations. Computer, 37(1), 78–83.

    Article  Google Scholar 

  3. Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). Maxprop: Routing for vehicle-based disruption-tolerant networks. In Proceedings of the IEEE international conference on computer communications, pp. 1–11.

  4. Segui, J., Jennings, E., & Burleigh S. (2011). Enhancing contact graph routing for delay tolerant space networking. In Proceedings of the IEEE global telecommunications conference, pp. 1–6.

  5. Ribeiro, F. J. L., Pedroza, A. D. C. P., & Costa, L. H. M. K. (2012). Deepwater monitoring system in underwater delay/disruption tolerant network. IEEE Latin America Transactions, 10(1), 1125–1134.

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. Jones, E. P. C., Li, L., & Ward, P. A. S. (2007). Practical routing in delay-tolerant networks. IEEE Transaction on Mobile Computing, 6(8), 943–959.

    Article  Google Scholar 

  8. Acer, U., Giaccone, P., Hay, D., Neglia, G., & Tarapiah, S. (2011). Timely data delivery in a realistic bus network. In Proceedings of the IEEE international conference on computer communications, pp. 446–450.

  9. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks. Technical report, Duke CS-200006, Duke University.

  10. Haas, Z. J., & Small, T. (2006). A new networking model for biological applications of ad hoc networks. IEEE/ACM Transaction on Networking, 14(1), 27–40.

    Article  Google Scholar 

  11. Zhang, J., & Luo, G. (2012). Adaptive spraying for routing in delay tolerant networks. Wireless Personal Communications, 66(1), 217–233.

    Article  Google Scholar 

  12. Lindgren, A., Doria, A., & Schelen, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 239–254.

    Article  Google Scholar 

  13. Balasubramanian, A., Levine, B. N., & Venkataramani, A. (2007). DTN routing as a resource allocation problem. In Proceedings of the ACM special interest group on data communication, pp. 373–384.

  14. Mtibaa, A., May, M., Diot, C., & Ammar, M. (2010). PeopleRank: Social opportunistic forwarding. In Proceedings of the IEEE international conference on computer communications, pp. 1–5.

  15. Wu, J., & Wang, Y. (2012). Social feature-based multi-path routing in delay tolerant networks. In Proceedings of the IEEE international conference on computer communications, pp. 1368–1376.

  16. Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2007). Impact of human mobility on the design of opportunistic forwarding algorithms. IEEE Transaction on Mobile Computing, 6(6), 606–620.

    Article  Google Scholar 

  17. Nain, P., Towsley, D., Liu, B., & Liu, Z. (2005). Properties of random direction models. In Proceedings of the IEEE international conference on computer communications, pp. 1897–1907.

Download references

Acknowledgments

This work is supported by Anhui Natural Science Foundation, China [1208085MF89, 1308085MF87], Open Fund of State Key Lab. for Novel Software Technology, Nanjing University, China [KFKT2011B18], SRF for ROCS, SEM [2013JYLH0280], and the Fundamental Research Funds for the Central Universities [2013HGXJ0232, 2013HGXJ0233].

Author information

Authors and Affiliations

  1. School of Mathematics, Hefei University of Technology, Hefei, 230009, China

    Qingshan Wang & Qi Wang

  2. Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, China

    Qingshan Wang & Qi Wang

Authors
  1. Qingshan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qingshan Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Q., Wang, Q. Memory Forwarding Algorithm in Multiple Communities Delay Tolerant Networks. Wireless Pers Commun 74, 703–715 (2014). https://doi.org/10.1007/s11277-013-1315-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1315-5

Keywords

Search

Navigation