Skip to main content
SpringerLink
Log in

Adaptive Forwarding Scheme for Bounded Time Constraint in Delay Tolerant Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In parallel with lots of research to improve message delivery rate in Delay Tolerant Networks (DTN), additional application specific requirements are demanded to deploy them in the real world. Among many requirements, we focus on desired delivery ratio within required deadline in DTN. To achieve this, we propose an adaptive forwarding algorithm primarily based on well-known DTN algorithm, Spray and Wait. Unlike conventional static forwarding schemes, the number of message copies and forwarding algorithm are dynamically adjusted according to the difference between current service level and given requirement in the proposed scheme. Furthermore, analytical model and recorded history on a node are used sequentially depending on availability of parameters to meet application specific requirement. Finally, simulation results demonstrate that our proposed algorithm can meet given requirement with lower resources consumption than existing protocols in varying network conditions.

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

Similar content being viewed by others

References

  1. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Technical Report. CS-2000-06, Duke University, Durham, USA.

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

    Article  Google Scholar 

  3. Balasubramanian, A., Levine, B. N., & Venkataramani, A. (2010). Replication routing in DTNs: A resource allocation approach. IEEE/ACM Transactions on Networking, 8(2), 596–609.

    Article  Google Scholar 

  4. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and Wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACM SIGCOMM workshop on Delay Tolerant Network, (pp. 252–259), August 2005.

  5. Ishimaru, Y., Sun, W., Yasumoto, K., & Ito, M. (2010). Dtn-based delivery of word-of-mouth information with priority and deadline. In Proceedings of 5th international conference on mobile computing and ubiquitous networking.

  6. Fu, Q., Krishnamachari, B., & Zhang L, L. (2013). DAWN: A density adaptive routing for deadline-based data collection in vehicular delay tolerant networks. Tsinghua Science and Technology, 18(3), 230–241.

    Article  Google Scholar 

  7. Abbas, A., Lee, C., & KIM, K. (2015). Delay bounded spray and wait in delay tolerant networks. In Proceedings of 9th ACM International Conference on Ubiquitous Information Management and Communication, January 2015.

  8. 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 

  9. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Proceedings of 5th annual IEEE international conference on pervasive computing and communications workshop, pp. (79–85), March 2007.

  10. Nelson, S. C., Bakht, M., & Kravets ,R. (2009). Encounter-based routing in DTNs. In Proceedings of the 28th conference on computer communication, pp. (846–854), April 2009.

  11. Bulut, E., Wang, Z., & Szymanski, B. K. (2010). Cost effective multi-period spraying for routing in delay tolerant networks. IEEE/ACM Transactions on Networking, 18(5), 1530–1543.

    Article  Google Scholar 

  12. Bulut, E., Wang, Z., & Szymanski, B. K (2008). Time dependent message spraying for routing in intermittently connected networks. In IEEE GLOBECOM.

  13. Hou, F., & Shen, X. (2009). An adaptive forwarding scheme for message delivery over delay tolerant networks. In IEEE GLOBECOM.

  14. Mamoun, M. (2013). New adaptive routing proposal for DTN. International Journal of Computer Applications, 82(9), 37–40.

    Article  Google Scholar 

  15. Guan, J., Chu, Q., & You, I (2017). The social relationship based adaptive multi-spray-and-wait routing algorithm for disruption tolerant network. Mobile Information Systems, 2017, 1819495.

    Article  Google Scholar 

  16. Spaho, E., Bylykbashi, K., Barolli, L., Kolici, V., & Lala, A. (2016). Evaluation of different DTN routing protocols in an opportunistic network considering many-to-one communication scenario. In Proceedings of IEEE 19th international conference on network-based information systems, September 2016.

  17. Chen, K., Shen, H., & Yan, L. (2015). Multicent: A multifunctional incentive scheme adaptive to diverse performance objectives for DTN routing. IEEE Transactions on Parallel and Distributed Systems, 26(6), 1643–1653.

    Article  Google Scholar 

  18. Araniti, G., Bezirgiannidis, N., Birrane, E., Bisio, I., Burleigh, S., Caini, C., Feldmann, M., Marchese, M., Segui, J., & Suzuki, K. (2008). Contact graph routing in DTN space networks: Overview, enhancements and performance. In IEEE GLOBECOM.

  19. Keranen, A., Ott, J., & Karkkainen, T. (2015). The ONE simulator for dtn protocol evaluation. IEEE Communications Magazine, 53(3), 38–46.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by Basic Science Research Program (2015R1D1A1A01056979) through the National Research Foundation of Korea (NRF) funded by the Ministry of Education. Also, it was supported by Research Incentive Fund (RIF Activity Code: R17058) by Zayed University, Abu Dhabi, UAE. A preliminary version of this paper was presented at the 9th ACM International Conference on Ubiquitous Information Management and Communication, 2015.

Author information

Authors and Affiliations

  1. Department of Computing, Middle East College, Muscat, Oman

    Ali Abbas

  2. College of Technological Innovation, Zayed University, Abu Dhabi, UAE

    Babar Shah

  3. Department of Computer Science and Engineering, Chungnam National University, Daejeon, Korea

    Ki-Il Kim

Authors
  1. Ali Abbas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Babar Shah
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ki-Il Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ki-Il Kim.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abbas, A., Shah, B. & Kim, KI. Adaptive Forwarding Scheme for Bounded Time Constraint in Delay Tolerant Networks. Wireless Pers Commun 96, 1803–1817 (2017). https://doi.org/10.1007/s11277-017-4269-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4269-1

Keywords

Search

Navigation