Skip to main content
SpringerLink
Log in

An optimized content delivery approach based on demand–supply theory in disruption-tolerant networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Disruption-tolerance networks (DTNs) are suitable for applications that may lack continuous network connectivity. Examples of such applications include coupon distribution, crisis relief, traffic notification, and broadcasting news from a website. Generally, these contents have a temporal constraint, so that their value will be decreased over time. DTNs have to utilize mobile relay nodes to transmit messages from the sender to the destination. These relay nodes often have selfish behavior, leading to a lack of cooperation. To improve the overall routing functionality, one must motivate relay nodes to share their resources. Thus, different incentives and rewarding mechanisms must be devised to encourage cooperation. We believe that microeconomics theories are appropriate mathematical tools to model the interactions between the DTN nodes. In microeconomics, buyers aim at maximizing their utility concerning their budget constraints. In this paper, the demand–supply theory is deployed to mitigate nodes’ selfishness and to create incentives among them. Each user can receive multiple sub-messages each of which containing special benefits for his/her. In this way, nodes are motivated to forward messages, which in turn leads to greater profitability for them and maximizing the social welfare of the society. The simulation of the proposed algorithm illustrates its superiority in terms of significant criteria such as delivery ratio, end-to-end delay, number of dropped messages, buffering time, number of hops, overhead ratio, etc.

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.

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. Hajiaghajani, F., Thulasidharan, Y. P., Taghizadeh, M., & Biswas, S. (2014). Economy driven content dissemination in delay tolerant networks. Ad Hoc Networks, 20, 132–149.

    Article  Google Scholar 

  2. Ning, Z., Liu, L., Xia, F., Jedari, B., Lee, I., & Zhang, W. (2016). CAIS: A copy adjustable incentive scheme in community-based socially aware networking. IEEE Transactions on Vehicular Technology, 66(4), 3406–3419.

    Article  Google Scholar 

  3. Wu, J., Guo, Y., Zhou, H., Shen, L., & Liu, L. (2020). Vehicular delay tolerant network routing algorithm based on Bayesian network. IEEE Access, 8, 18727–18740.

    Article  Google Scholar 

  4. Qirtas, M. M., Faheem, Y., & Rehmani, M. H. (2020). A cooperative mobile throwbox-based routing protocol for social-aware delay tolerant networks. Wireless Networks, 1–13.

  5. Ma, X., Zhang, X., & Yang, R. (2019). Reliable energy-aware routing protocol in delay-tolerant mobile sensor networks. Wireless Communications and Mobile Computing, 2019, 1–11.

  6. Lobiyal, D. K. (2019). Location based contact time energy efficient routing (LCTEE) approach for delay tolerant networks. Wireless Personal Communications, 108(4), 2639–2662.

    Article  Google Scholar 

  7. Brown, J. R., & Rohrer, J. P. (2018). DTN routing protocols for drone swarm telemetry. In Proceedings of the International Telemetering Conference (ITC), Las Vegas, NV, pp. 1–10.

  8. Socievole, A., Caputo, A., De Rango, F., & Fazio, P. (2019). Routing in mobile opportunistic social networks with selfish nodes. Wireless Communications and Mobile Computing, 2019, 1–15.

  9. Kulkarni, L., Bakal, J., & Shrawankar, U. (2020). Energy based incentive scheme for secure opportunistic routing in vehicular delay tolerant networks. Computing, 102(1), 201–219.

    Article  Google Scholar 

  10. Liaqat, H. B., Ali, A., Qadir, J., Bashir, A. K., Bilal, M., & Majeed, F. (2019). Socially-aware congestion control in ad-hoc networks: Current status and the way forward. Future Generation Computer Systems, 97, 634–660.

    Article  Google Scholar 

  11. Roy, S. C., Islam, M. A., & Rahim, M. S. (2019). A study on the performance of delay-tolerant network routing protocols in the campus area of Rajshahi University, Bangladesh. In 2019 International conference on electrical, computer and communication engineering (ECCE) (pp. 1–6). IEEE.

  12. Singh, A. K., Bera, T., & Pamula, R. (2018). PRCP: Packet replication control based prophet routing strategy for delay tolerant network. In 2018 4th International conference on recent advances in information technology (RAIT) (pp. 1–5). IEEE.

  13. Singh, A. K., & Pamula, R. (2018). IRS: Incentive based routing strategy for socially aware delay tolerant networks. In 2018 5th International conference on signal processing and integrated networks (SPIN) (pp. 343–347). IEEE.

  14. Besharati, R., Esfandiari, S., Khajevand, V. & Rezvani, M. H. (2019). RBCRP: A routing approach based on crowded rendezvous points in delay tolerant networks. In 2019 5th Conference on knowledge based engineering and innovation (KBEI) (pp. 571–576). IEEE.

  15. Yang, S. Y., Jiang, J. T., & Chen, P. (2013). OOPProPHET: A new routing method to integrate the delivery predictability of ProPHET-routing with OOP-routing in delay tolerant networks. JCP, 8(7), 1656–1663.

    Google Scholar 

  16. Harrati, Y., & Abdali, A. (2017). MaxHopCount: DTN congestion control algorithm under MaxProp routing. IJCSNS, 17(5), 206.

    Google Scholar 

  17. Jain, S., & Yadav, P. (2017). Controlled replication based bubble rap routing algorithm in delay tolerant network. In International conference on next generation computing technologies (pp. 70–87). Springer, Singapore.

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

  19. Shah, S. F. A., Zafar, M. H., Andonovic, I. & Jan, T. (2016). Hybrid routing scheme for vehicular delay tolerant networks. In 2016 8th Computer science and electronic engineering (CEEC) (pp. 158–163). IEEE.

  20. Harrati, Y., & Abdali, A. (2019). Performance analysis of adaptive fuzzy spray and wwait routing protocol. Journal of Communications, 14(8), 739–744.

  21. Sharma, A. (2019). Resource utilization of DTN routing protocols by calculating energy consumption of mobile nodes. In Pervasive computing: A networking perspective and future directions (pp. 47–52). Springer, Singapore.

  22. Baek, K. M., Seo, D. Y., & Chung, Y. W. (2018). An improved opportunistic routing protocol based on context information of mobile nodes. Applied Sciences, 8(8), 1344.

    Article  Google Scholar 

  23. Samyal, V. K., & Sharma, Y. K. (2017). Analysis of selfish node behavior in delay tolerant networks routing protocols. Proc International Journal of Innovative Research in Science and Engineering, 3(1), 377–384.

    Google Scholar 

  24. Zou, S., Wang, W., & Wang, W. (2013). A routing algorithm on delay-tolerant of wireless sensor network based on the node selfishness. EURASIP Journal on Wireless Communications and Networking, 2013(1), 212.

    Article  Google Scholar 

  25. Jain, S., Chawla, M., Soares, V. N., & Rodrigues, J. J. (2016). Enhanced fuzzy logic-based spray and wait routing protocol for delay tolerant networks. International Journal of Communication Systems, 29(12), 1820–1843.

    Article  Google Scholar 

  26. Jiang, Q., Deng, K., Zhang, L., & Liu, C. (2019). A privacy-preserving protocol for utility-based routing in DTNs. Information, 10(4), 128.

    Article  Google Scholar 

  27. Zhao, R., Wang, X., Lin, Y., Yang, Y., Hui, T., & Zhang, L. (2017). A controllable multi-replica routing approach for opportunistic networks. IEEJ Transactions on Electrical and Electronic Engineering, 12(4), 589–600.

    Article  Google Scholar 

  28. Jones, E. P., & Ward, P. A. (2006). Routing strategies for delay-tolerant networks. Submitted to ACM Computer Communication Review (CCR).

  29. Kushwaha, V., & Gupta, R. (2019). Delay tolerant networks: Architecture, routing, congestion, and security issues. In D. P. Agrawal (Ed.), Handbook of research on cloud computing and big data applications in IoT (pp. 448–480). IGI Global.

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

  31. Karimi, S., & Darmani, Y. (2019). p-epidemic forwarding method for heterogeneous delay-tolerant networks. The Journal of Supercomputing, 75(11), 7244–7264.

    Article  Google Scholar 

  32. Cui, J., Cao, S., Chang, Y., Wu, L., Liu, D., & Yang, Y. (2019). An adaptive spray and wait routing algorithm based on quality of node in delay tolerant network. IEEE Access, 7, 35274–35286.

    Article  Google Scholar 

  33. Alhasanat, A., Alhasanat, M., Althunibat, S., & Matrouk, K. (2019). A probabilistic home-based routing scheme for delay tolerant networks. Wireless Networks, 25(7), 4037–4048.

    Article  Google Scholar 

  34. Dubey, B. B., Chauhan, N., Chand, N., & Awasthi, L. K. (2017). Incentive based scheme for improving data availability in vehicular ad-hoc networks. Wireless Networks, 23(6), 1669–1687.

    Article  Google Scholar 

  35. Hossen, M. S. (2019). DTN routing protocols on two distinct geographical regions in an opportunistic network: an analysis. Wireless Personal Communications, 108(2), 839–851.

    Article  Google Scholar 

  36. Jain, S., & Verma, A. (2019). Bubble rap incentive scheme for prevention of node selfishness in delay-tolerant networks. In Smart innovations in communication and computational sciences (pp. 289–303). Springer, Singapore.

  37. He, Y., Li, H., Cheng, X., Liu, Y., Yang, C., & Sun, L. (2018). A blockchain based truthful incentive mechanism for distributed P2P applications. IEEE Access, 6, 27324–27335.

    Article  Google Scholar 

  38. Wang, H., Wang, H., Guo, F., Feng, G., & Lv, H. (2018). ARAG: A routing algorithm based on incentive mechanisms for DTN with nodes’ selfishness. IEEE Access, 6, 29419–29425.

    Article  Google Scholar 

  39. Zhao, Y., Song, W., & Han, Z. (2016). Social-aware data dissemination via device-to-device communications: Fusing social and mobile networks with incentive constraints. IEEE Transactions on Services Computing, 489–502.

  40. Zhu, K., Li, W., & Fu, X. (2014). SMART: A social-and mobile-aware routing strategy for disruption-tolerant networks. IEEE Transactions on Vehicular Technology, 63(7), 3423–3434.

    Article  Google Scholar 

  41. Zhu, K., Li, W., Fu, X., & Zhang, L. (2015). Data routing strategies in opportunistic mobile social networks: Taxonomy and open challenges. Computer Networks, 93, 183–198.

    Article  Google Scholar 

  42. Cai, Y., Fan, Y., & Wen, D. (2015). An incentive-compatible routing protocol for two-hop delay-tolerant networks. IEEE Transactions on Vehicular Technology, 65(1), 266–277.

    Article  Google Scholar 

  43. Jagtap, P., & Kulkarni, L. (2019). Social energy-based techniques in delay-tolerant network. In Emerging technologies in data mining and information security (pp. 531–538). Springer, Singapore.

  44. Yao, L., Man, Y., Huang, Z., Deng, J., & Wang, X. (2015). Secure routing based on social similarity in opportunistic networks. IEEE Transactions on Wireless Communications, 15(1), 594–605.

    Article  Google Scholar 

  45. Lin, Z., Wang, S., Liu, C., & Ikram, M. (2016). A Mechanism design solution for DTN routing. In 2016 International conference on identification, information and knowledge in the internet of things (IIKI) (pp. 361–369). IEEE.

  46. Mao, Y., Zhou, C., Ling, Y., & Lloret, J. (2019). An optimized probabilistic delay tolerant network (DTN) routing protocol based on scheduling mechanism for internet of things (IoT). Sensors, 19(2), 243.

    Article  Google Scholar 

  47. Wu, C., Yoshinaga, T., Bayar, D., & Ji, Y. (2019). Learning for adaptive anycast in vehicular delay tolerant networks. Journal of Ambient Intelligence and Humanized Computing, 10(4), 1379–1388.

    Article  Google Scholar 

  48. Sakai, K., Sun, M. T., & Ku, W. S. (2019). Data-intensive routing in delay-tolerant networks. In IEEE INFOCOM 2019-IEEE conference on computer communications (pp. 2440–2448). IEEE.

  49. Yuan, F., Wu, J., Zhou, H., & Liu, L. (2019). A Double Q-learning routing in delay tolerant networks. In ICC 2019-2019 IEEE international conference on communications (ICC) (pp. 1–6). IEEE.

  50. Roy, A., Acharya, T., & DasBit, S. (2019). Fairness in message delivery in delay tolerant networks. Wireless Networks, 25(4), 2129–2142.

    Article  Google Scholar 

  51. Jehle, G. A., & Reny, P. J. (2001). Advanced Microeconomic Theory. Boston: Addison Wesley Longman.

    Google Scholar 

  52. Mohammadi, A., & Rezvani, M. H. (2019). A novel optimized approach for resource reservation in cloud computing using producer–consumer theory of microeconomics. The Journal of Supercomputing, 75(11), 7391–7425.

    Article  Google Scholar 

  53. Tavakoli-Someh, S., & Rezvani, M. H. (2019). Multi-objective virtual network function placement using NSGA-II meta-heuristic approach. The Journal of Supercomputing, 75(10), 6451–6487.

    Article  Google Scholar 

  54. Parvizi, E., & Rezvani, M. H. (2020). Utilization-aware energy-efficient virtual machine placement in cloud networks using NSGA-III meta-heuristic approach. Cluster Computing. https://doi.org/10.1007/s10586-020-03060-y.

  55. Opportunistic Network Environment (ONE) simulator. Retrieved September 2019, from https://akeranen.github.io/the-one/.

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer and Information Technology Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

    Samira Esfandiari & Mohammad Hossein Rezvani

Authors
  1. Samira Esfandiari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Hossein Rezvani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad Hossein Rezvani.

Ethics declarations

Conflict of interest

On behalf of all authors, the corresponding author states that there is no conflict of interest.

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

Esfandiari, S., Rezvani, M.H. An optimized content delivery approach based on demand–supply theory in disruption-tolerant networks. Telecommun Syst 76, 265–289 (2021). https://doi.org/10.1007/s11235-020-00711-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-020-00711-8

Keywords

Search

Navigation