Skip to main content
SpringerLink
Log in

Integrated Sized-Based Buffer Management Policy for Resource-Constrained Delay Tolerant Network

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Delay tolerant network is a type of network where the end-to-end path is not available from source to destination due to the node mobility, dynamic topology and network partitioning or such a path is highly unstable and may split almost immediately after it has been explored. In this background, existing ad hoc routing protocols would be unsuccessful. Therefore, the concept of store-carry-forward mechanism is utilized by introducing a new layer on the top of transport layer called as bundle layer. The bundle layer store message(s) in a finite size buffer for the long duration of time. As a result, node buffer runs out of space and drop messages to overcome congestion. In this paper, we aim to schedule the node buffer by using local knowledge-based buffer management policies called as best message-size selections buffer management policy. We have utilized the local information available in message header such as message-size to control the drop of messages. The evaluation of proposed policy with the existing DOA, DLA, LIFO, MOFO, N-drop and SHLI have been analyzed in ONE simulator in terms of reducing message drop, overhead, latency and raising the delivery ratio.

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
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. Nelson, S. C., Bakht, M., Kravets, R., & Harris, A. F, I. I. I. (2009). Encounter: Based routing in DTNs. ACM SIGMOBILE Mobile Computing and Communications Review, 13(1), 56–59.

    Article  Google Scholar 

  5. Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of SIGCOMM, ACM, pp. 27–34.

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

    Article  Google Scholar 

  7. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Kansas City: Citeseer.

    Google Scholar 

  8. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking, ACM, pp. 252–259.

  9. Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). Maxprop: Routing for vehicle-based disruption-tolerant networks. In 25th IEEE international conference on computer communications, Vol. 6, Citeseer, pp. 1–11.

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

    Article  Google Scholar 

  11. Scott, K. L., & Burleigh, S. (2007). Bundle protocol specification.

  12. Rashid, S., Ayub, Q., Zahid, M. S. M., & Abdullah, A. H. (2013). Message drop control buffer management policy for DTN routing protocols. Wireless Personal Communications, 72(1), 653–669.

    Article  Google Scholar 

  13. Small, T., & Haas, Z. J. (2005). Resource and performance tradeoffs in delay-tolerant wireless networks. In Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking, ACM, pp. 260–267.

  14. Zhang, X., Zhang, H., & Gu, Y. (2010). Impact of source counter on DTN routing control under resource constraints. In Proceedings of the second international workshop on mobile opportunistic networking, ACM, pp. 41–50.

  15. Kernen, A. (2008). Opportunistic network environment simulator. Special assignment report, Helsinki University of Technology, Department of Communications and Networking.

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

    Article  Google Scholar 

  17. Lindgren, A., & Phanse, K. S. (2006). Evaluation of queuing policies and forwarding strategies for routing in intermittently connected networks. In First international conference on communication system software and middleware, 2006. Comsware 2006, IEEE, pp. 1–10.

  18. Rashid, S., Hanan Abdullah, A., Ayub, Q., & Zahid, S. M. (2013). Dynamic prediction based multi queue (DPMQ) drop policy for probabilistic routing protocols of delay tolerant network. Journal of Network and Computer Applications, 36(5), 1395–1402.

    Article  Google Scholar 

  19. Li, Y., Zhao, L., Liu, Z., Liu, Q. (2009). N-Drop: Congestion control strategy under epidemic routing in DTN. In Proceedings of the 2009 international conference on wireless communications and mobile computing: Connecting the world wirelessly.

  20. Lee, F. C., Goh, W., & Yeo, C. K. (2010). A queuing mechanism to alleviate flooding attacks in probabilistic delay tolerant networks. In 2010 sixth advanced international conference on telecommunications (AICT), IEEE, pp. 329–334.

  21. Leela-Amornsin, L., & Esaki, H. (2010). Heuristic congestion control for message deletion in delay tolerant network. In Smart spaces and next generation wired/wireless networking (pp. 287–298). Berlin, Heidelberg: Springer.

    Chapter  Google Scholar 

  22. Soares, V. N. G. J., Rodrigues, J. J. P. C., Ferreira, P. S., & Nogueira, A. M. D. (2009). Improvement of messages delivery time on vehicular delay-tolerant networks. In International conference on parallel processing workshops, IEEE, pp. 344–349.

  23. Rashid, S., & Ayub, Q. (2010). Effective buffer management policy DLA for DTN routing protocols under congestion. International Journal of Computer and Network Security, 2(9), 118–121.

    Google Scholar 

  24. Yin, L., Lu, H., & Gao, J. (2010). Buffer scheduling policy in DTN routing protocols. In 2010 2nd international conference on future computer and communication (ICFCC), Vol. 2, IEEE, pp. V2-808.

  25. Rahmouni, I., et al. (2016). An effective buffer management in delay tolerant networks based on a partially observed Markov decision process framework. International Journal of Communication Networks and Distributed Systems, 16(4), 368–387.

    Article  Google Scholar 

  26. Sati., S., Probst, C., & Graffi, K. (2016). Analysis of buffer management policies for opportunistic networks. In 2016 25th international conference on computer communication and networks (ICCCN), IEEE.

  27. Kaveevivitchai, S., Ochiai, H., & Esaki, H. (2010). Message deletion and mobility patterns for efficient message delivery in DTNs. In 2010 8th IEEE international conference on pervasive computing and communications workshops (PERCOM Workshops), IEEE, pp. 760–763.

  28. Li, Y., Qian, M., Jin, D., Su, L., & Zeng, L. (2009). Adaptive optimal buffer management policies for realistic DTN. In Global telecommunications conference, 2009. GLOBECOM 2009, IEEE, pp. 1–5.

  29. Krifa, A., Baraka, C., & Spyropoulos, T. (2008). Optimal buffer management policies for delay tolerant networks. In 5th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks, 2008. SECON’08, IEEE, pp. 260–268.

  30. Krifa, A., Chadi, B., & Spyropoulos, T. (2010). Message drop and scheduling in DTNs: Theory and practice.

  31. Sargent, R. G. (2005). Verification and validation of simulation models. In Proceedings of the 37th conference on winter simulation, pp. 130–143.

  32. Sargent, R. G. (2013). Verification and validation of simulation models. Journal of Simulation, 7(1), 12–24.

    Article  MathSciNet  Google Scholar 

  33. Kernen, A., & Ott, J. (2007). Increasing reality for DTN protocol simulations. Helsinki University of Technology, technical report.

Download references

Acknowledgements

This work was supported by START-UP RESEARCH GRANT PROGRAM of research project Buffer management policies for DTN routing protocol under resource scarce environment from HEC (No. 21-1334/SRGP/R&D/HEC/2016).

Author information

Authors and Affiliations

  1. Department of Computer Science, COMSATS University Islamabad, Wah Campus, Wah Cantt, Pakistan

    Sulma Rashid

  2. Department of Computer Science, University of Engineering and Technology, Taxila, Pakistan

    Qaisar Ayub

Authors
  1. Sulma Rashid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qaisar Ayub
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sulma Rashid.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rashid, S., Ayub, Q. Integrated Sized-Based Buffer Management Policy for Resource-Constrained Delay Tolerant Network. Wireless Pers Commun 103, 1421–1441 (2018). https://doi.org/10.1007/s11277-018-5861-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-018-5861-8

Keywords

Search

Navigation