Skip to main content
SpringerLink
Log in

Social Community Buffer Management Policy for Delay Tolerant Network

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Delay Tolerant Network offers communication architecture for scenarios where attaining uninterrupted connectivity between source and destination is challenging due to dynamic topology, short transmission range, and mobility of nodes. The messages are delivered by a store, carry, and forward mechanism in which the node store the messages in its buffer, and carries them while moving and forward to its opportunistically connected peers. The buffer space is limited, and the stored messages are dropped to overcome congestion. The existing buffer management policies have utilized the message header data fields to compute heuristic metrics, or probability measures and have not focused on incorporating community characteristics in designing algorithms. In this paper, we have proposed a Social Community Buffer Management Policy for Delay Tolerant Networks in which the community metric consisting of Global Rank Value (GRV) and Local Rank Value (LRV) has been introduced. The GRV is the ability of any individual node to encounter the community in which the message destination resides. Similarly, LRV is the ability of a node to directly connect to the message destination. The congested node does not drop messages for which it has higher GRV and LRV values than predefined thresholds. Furthermore, we have integrated a message-locking mechanism in which the combination of lock variables such as Source Drop Lock, Must Accommodate Lock, Local Rank Lock, and Global Rank Lock are introduced within the message header. We have performed the simulation of existing BMSS, DOA, LIFO, MOFO, Ndrop, SHLI, and DLA with SCBM under real-time mobility scenarios. The simulation result proves the proposed SCBM performs better in terms of increasing delivery rate, buffer time average, and reducing overhead, message transmissions, and message drop.

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

Similar content being viewed by others

Data Availability

Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.

References

  1. Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (pp. 27–34).

  2. Mangrulkar, R. S., & Atique, M. (2010). Routing protocol for delay tolerant network: A survey and comparison. In 2010 International conference on communication control and computing technologies (pp. 210–215). IEEE.

  3. Talukdar, M. I., & Hossen, M. S. (2018). Performance analysis of DTN routing protocols: Single-copy and multi-copy in ICMN scenario. In 2018 International conference on innovations in science, engineering and technology (ICISET) (pp. 407–411). IEEE.

  4. Chen, R., Bao, F., Chang, M., & Cho, J. H. (2010). Trust management for encounter-based routing in delay tolerant networks. In 2010 IEEE global telecommunications conference GLOBECOM 2010 (pp. 1–6). IEEE.

  5. Hom, J., Good, L., & Yang, S. (2017). A survey of social-based routing protocols in delay tolerant networks. In 2017 International conference on computing, networking, and communications (ICNC) (pp. 788–792). IEEE.

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

    Article  Google Scholar 

  7. Zhu, Y., Xu, B., Shi, X., & Wang, Y. (2012). A survey of social-based routing in delay tolerant networks: Positive and negative social effect. IEEE Communications Surveys & Tutorials, 15(1), 387–401.

    Article  Google Scholar 

  8. Hui, P., Crowcroft, J., & Yoneki, E. (2010). Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing, 10(11), 1576–1589.

    Article  Google Scholar 

  9. De Rango, F., & Tropea, M. (2022). DTN architecture with resource-aware rate adaptation for multiple bundle transmission in InterPlanetary networks. In IEEE Access (vol. 10, pp. 47219-47234). https://doi.org/10.1109/ACCESS.2022.3168191

  10. Han, C., Yao, H., Mai, T., Zhang, N., & Guizani, M. (2021). QMIX aided routing in social-based delay-tolerant networks. IEEE Transactions on Vehicular Technology, 71(2), 1952–1963.

    Article  Google Scholar 

  11. Gallego-Tercero, L. R., Menchaca-Mendez, R., Rivero-Angeles, M. E., & Menchaca-Mendez, R. (2020). Efficient time-stable geocast routing in delay-tolerant vehicular ad-hoc networks. IEEE Access, 8, 171034–171048.

    Article  Google Scholar 

  12. Wang, T., Tang, M., & Cao, Y. (2019). Resource optimization protocol based on multicommunity model for intermittently connected mobile networks. IEEE Systems Journal, 14(1), 410–421.

    Article  Google Scholar 

  13. Rashid, S., Ayub, Q., Zahid, M. S. M., & Abdullah, A. H. (2011). E-drop: An effective drop buffer management policy for DTN routing protocols. International Journal of Computer Applications, 13, 118–121.

    Article  Google Scholar 

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

  15. Rashid, S., Ayub, Q., & Abdullah, A. H. (2015). Reactive weight-based buffer management policy for DTN routing protocols. Wireless Personal Communications, 80(3), 993–1010.

    Article  Google Scholar 

  16. Rashid, S., & Ayub, Q. (2018). Integrated sized-based buffer management policy for resource-constrained delay tolerant network. Wireless Personal Communications, 103(2), 1421–1441.

    Article  Google Scholar 

  17. Ayub, Q., Ngadi, A., Rashid, S., & Habib, H. A. (2018). Priority queue based reactive buffer management policy for delay tolerant network under city-based environments. PLoS ONE, 13(2), e0191580.

    Article  Google Scholar 

  18. Rashid, S., Abdullah, A. H., Ayub, Q., & Zahid, M. 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. Krifa, A., Baraka, C., & Spyropoulos, T. (2008). Optimal buffer management policies for delay tolerant networks. In Proceedings of the 5th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks (pp. 260–268) San Francisco.

  20. Elwhishi, A., Ho, P. H., Naik, K., & Shihada, B. (2013). A novel message scheduling framework for delay tolerant networks routing. IEEE Transactions on Parallel and Distributed Systems, 24, 871–880.

    Article  Google Scholar 

  21. Matzakos, P., Spyropoulos, T., & Bonnet, C. (2015). Buffer management policies for DTN applications with different QoS requirements. In IEEE global communications conference (GLOBECOM) (pp. 1–7). San Diego. https://doi.org/10.1109/GLOCOM.2015.7417744

  22. Naves, J. F., Moraes, I. M., & Albuquerque, C. (2012). LPS and LRF: Efficient buffer management policies for delay and disruption tolerant networks. In 37th annual IEEE conference on local computer networks. https://doi.org/10.1109/lcn.2012.6423649

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

  24. Wang, H., Feng, G., Wang, H., Lv, H., & Zhou, R. (2018). RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight. International Journal of Distributed Sensor Networks, 14(3), 1550147718757874.

    Article  Google Scholar 

  25. Souza, C., Mota, E., Manzoni, P., Cano, J. C., Calafate, C. T., Hernandez-Orallo, E., & Tapia, J. H. (2018). Friendly-drop: A social-based buffer management algorithm for opportunistic networks. In 2018 Wireless days (WD). https://doi.org/10.1109/wd.2018.8361714

  26. Savita, & Lobiyal, D. K. (2020). Inter-contact delay and location information-based routing with adaptive threshold buffer management for delay tolerant networks. International Journal of Information and Communication Technology, 17(4), 307–328.

    Article  Google Scholar 

  27. Sobin, C. C. (2016). An efficient buffer management policy for DTN. Procedia Computer Science, 93, 309–314.

    Article  Google Scholar 

  28. Yuan, P., & Yu, H. (2017). A combinational buffer management scheme in mobile opportunistic network. Future Internet, 9(4), 82.

    Article  MathSciNet  Google Scholar 

  29. Li, Y., Qian, M., Jin, D., Su, L., & Zeng, L. (2009) Adaptive optimal buffer management policies for realistic DTN. In Proceedings of the IEEE global telecommunications conference (pp. 1–5), Honolulu, 30 November–4 December.

  30. Yao, J., Ma, C., Yu, H., Liu, Y., & Yuan, Q. (2017). A utility-based buffer management policy for improving data dissemination in opportunistic networks. China Communications, 14, 118–126.

    Article  Google Scholar 

  31. Iranmanesh, S. (2016). A novel queue management policy for delay-tolerant networks. EURASIP Journal on Wireless Communications and Networking, 2016(1), 1–23.

    Article  MathSciNet  Google Scholar 

  32. Wang, E., Yang, Y. J., Wu, J., & Liu, W. B. (2016). A buffer scheduling method based on message priority in delay tolerant networks. Journal of Computer Science and Technology, 31(6), 1228–1245. https://doi.org/10.1007/s11390-016-1694-7

    Article  Google Scholar 

  33. Pan, D., Ruan, Z., Zhou, N., Liu, X., & Song, Z. (2013). A comprehensive-integrated buffer management strategy for opportunistic networks. EURASIP Journal on Wireless Communications and Networking. https://doi.org/10.1186/1687-1499-2013-103

    Article  Google Scholar 

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

  35. Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques (pp. 1–10).

Download references

Funding

Funding information is not applicable/No funding was received.

Author information

Authors and Affiliations

  1. COMSATS Islamabad University, Wah Campus, Wah Cantt, Pakistan

    Sulma Rashid

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

Contributions

All authors contributed equally to this work.

Corresponding author

Correspondence to Sulma Rashid.

Ethics declarations

Conflict of interest

“The all Authors declared that there is no conflict of interest.” The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rashid, S., Ayub, Q. Social Community Buffer Management Policy for Delay Tolerant Network. Wireless Pers Commun 130, 2099–2120 (2023). https://doi.org/10.1007/s11277-023-10373-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-023-10373-9

Keywords

Search

Navigation