Skip to main content

Advertisement

SpringerLink
Log in

DTN-Balance: A Forwarding-Capacity and Forwarding-Queue Aware Routing for Self-organizing DTNs

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In delay-tolerant networks (DTNs), intermittent network connectivity and lack of global system information pose serious challenges to achieve effective data forwarding. Most state-of-the-art DTN routing algorithms are based on hill-climbing heuristics in order to select the best available next hop to achieve satisfactory network throughput and routing efficiency. An adverse consequence of this approach is that a small subset of good users take on most of the forwarding tasks. This can quickly deplete scarce resources (e.g. storage, battery, etc.) in heavily utilized devices which degrades the network reliability. A system with a significant amount of traffic carried by a small number of users is not robust to denial of service attacks and random failures. To overcome these deficiencies, this paper proposes a new routing algorithm, DTN-Balance, that takes the forwarding capacity and forwarding queue of the relay nodes into account to achieve a better load distribution in the network. For this, we defined a new routing metric called message forwarding utility combining nodal available bandwidth and forwarding workload. Applying small world theory, we impose an upper bound on the end-to-end hop count that results in a sharp increase in routing efficiency. Queued messages in a forwarding node are arranged by DTN-Balance based on message dropping utility metric for a more intelligent decision in the case of a message drop. The performance of our method is compared with that of the existing algorithms by simulations on real DTN traces. The results show that our algorithm provides outstanding forward efficiency at the expense of a small drop in the throughput.

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 ACM SIGCOMM 03 (pp. 27–34).

  2. Rodrigues, J. J. P. C., & Soares, V. N. G. (2015). 1-An introduction to delay and disruption-tolerant networks(DTNs). Elsevier Journal of Advances in Delay-Tolerant Networks (DTNs), 2015, 1–21.

    Google Scholar 

  3. Jain, S., Fall, K. R., & Pattra, R. K. (2004). Routing in a delay tolerant network. In Proceedings of the SIGCOMM (pp. 145–158).

  4. Guo, S., & Keshav, S. (2007). Fair and efficient scheduling in data ferrying networks. In Proceedings of the of ACM/CoNEXT.

  5. Balasubramanian, A., Levine, B. N., & Venkataramani, A. (2007). Dtn routing as a resource allocation problem. In Proceedings of the of SIGCOMM.

  6. Lee, K., Yi, Y., Jeong, J., Won, H., Rhee, I., & Chong, S. (2010). Max-contribution: on optimal resource allocation in delay tolerant networks. In Proceedings of the IEEE INFOCOM (pp. 1–9).

  7. Fan, X., Li, V. O. K., & Xu, K. (2014). Fairness analysis of routing in opportunistic mobile networks. IEEE Transaction on Vehicular Technology, 63(3), 1.

    Article  Google Scholar 

  8. Pujol, J. M., Toledo, A. L., & Rodriguez, P. (2009). Fair routing in delay tolerant networks. In IEEE INFOCOM 2009 proceedings (pp. 837–845).

  9. Qi, Y., Yang, L., Pan, C., et al. (2020). CGR-QV: A virtual topology DTN routing algorithm based on queue scheduling. IEEE China Communications, 17(7), 113–123.

    Article  Google Scholar 

  10. Vazintari, A., & Cottis, P. G. (2016). Mobility management in energy constrained self-organizing delay tolerant networks: An autonomic scheme based on game theory. IEEE Transactions on Mobile Computing, 15(6), 1401–1411.

    Article  Google Scholar 

  11. Pham, T. N. D., & Yeo, C. K. (2016). Detecting colluding blackhole and greyhole attacks in delay tolerant networks. IEEE Transactions on Mobile Computing, 15(5), 1116–1129.

    Article  Google Scholar 

  12. Le, T., & Gerla, M. (2015). A load balanced social-tie routing strategy for DTNs based on queue length control. In IEEE military communications conference (pp. 383–387).

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

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

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

    Article  Google Scholar 

  16. Choochotkaew, S., Yamaguchi, H., & Higashino, T. (2018). BALANCE: A robust routing protocol in self-organized civilian DTN. In 2018 14th international conference on wireless and mobile computing, networking and communications (WiMob).

  17. Sharif, H. Md. (2019). DTN routing protocols on two distinct geographical regions in an opportunistic network: An analysis. In Springer wireless personal communications.

  18. Erramilli, V., Chaintreau, A., Crovella, M., & Diot, C. (2008). Delegation Forwarding. In Proceedings of the ACM MobiHoc.

  19. Dubois-Ferriere, H., Grossglauser, M., & Vetterli, M. (2003). Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages. In Proceedings of the ACM MobiHoc (pp. 257–266).

  20. Nelson, S. C., Bakht, M., Kravets, R. (2009). Encounter based routing in DTNs. In INFOCOM 2009. New York: IEEE (pp. 846–854).

  21. Liu, C., & Wu, J. (2009). An optimal probabilistic forwarding protocol in delay tolerant networks. In MobiHoc09 (pp. 105–114).

  22. Lindgren, A., Doria, A., & Scheln, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE, 7(3), 19–20.

    Google Scholar 

  23. Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). MaxProp: routing for vehicle-based disruption-tolerant networks. In Proceedings of the IEEE INFOCOM (pp. 1–11).

  24. Grasic, S., Davies, E., Lindgren, A., & Doria, A. (2011). The evolution of a DTN routing protocol PRoPHETv2. In CHANTS11 (pp. 27–30).

  25. Link, J., Schmitz, D., & Wehrle, K. (2011). GeoDTN: Geographic routing in disruption tolerant networks. In Proceedings of the IEEE GLOBECOM (pp. 1–5).

  26. Kurhinen, J., & Janatuinen, J. (2007). Geographical routing for delay tolerant encounter networks. In Proceedings of the IEEE ISCC (pp. 463–467).

  27. Leguay, J., Friedman, T., & Conan, V. (2005). DTN routing in a mobility pattern space. In Proceedings of the ACM SIGCOMM WDTN (pp. 276–283).

  28. Fan, J., Chen, J., Du, Y., Gao, W., Wu, J., & Sun, Y. (2013). Geo community based broadcasting for data dissemination in mobile social networks. IEEE Transactions on Parallel and Distributed Systems, 24(4), 734–743.

    Article  Google Scholar 

  29. Li, F., & Wu, J. (2009). MOPS: Providing content-based service in disruption-tolerant networks. In Proceedings of the IEEE ICDCS (pp. 526–533).

  30. Daly, E. M., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant MANETs. In Proceedings of the ACM MobiHoc (pp. 32–40)

  31. Hui, P., Crowcroft, J., & Yoneki, E. (2008). Bubble rap: Social-based forwarding in delay tolerant networks. In Proceedings of the ACM MobiHoc (pp. 241–250).

  32. Gao, W., Cao, G., La Porta, T., & Han, J. (2013). On exploiting transient social contact patterns for data forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing, 12(1), 151–165.

    Article  Google Scholar 

  33. Wu, J., & Wang, Y. (2012). Social feature-based multi-path routing in delay tolerant networks. In 2012 proceedings IEEE INFOCOM (pp. 1368–1376).

  34. Chen, K., & Shen, H. (2015). DTN-FLOW: Inter-landmark data flow for high-throughput routing in DTNs. IEEE/ACM Transactions on Networking, 23(1), 212–226.

    Article  Google Scholar 

  35. Tantai, J., Bai, Y., Zhao, Y., Liu, J., & Chen, W. (2015). Capacity routing based message priority for delay tolerant networks. In Proceedings of the 24th international conference on computer communications and networks (ICCCN).

  36. Haoran, S., Muqing, W., & Yanan, C. (2019). A community-based opportunistic routing protocol in delay tolerant networks. In 2018 IEEE 4th international conference on computer and communications (ICCC). New York: IEEE.

  37. Qi, W., Song, Q., Wang, X., & Guo, L. (2017). Trajectory data mining-based routing in DTN-enabled vehicular ad hoc networks. IEEE Access, 5, 24128–24138.

    Article  Google Scholar 

  38. Wang, W., Bai, Y., Feng, P., et al. (2018). DTN-Knca: A high throughput routing based on contact pattern detection in DTNs. In 2018 IEEE 42nd annual computer software and applications conference (COMPSAC), Tokyo (pp. 926–931). https://doi.org/10.1109/COMPSAC.2018.00159.

  39. Wen, Z., et al. (2019). An adaptive probability prediction routing scheme in urban DTNs. In 2019 IEEE 25th international conference on parallel and distributed systems (ICPADS). New York: IEEE.

  40. Nahrstedt, K., & Vu, L. (2012). CRAWDAD data set uiuc/uim (v. 2012-01-24). Downloaded from http://crawdad.cs.dartmouth.edu/uiuc/uim.

  41. Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., & Chaintreau, A. (2009). Data set cambridge/haggle/imote/infocom2006 (Online). http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/infocom2006.

  42. The ONE simulator, an Available Website. http://www.netlab.tkk.fi/tutkimus/dtn/theone/.

Download references

Acknowledgements

This work is supported by the National Science Foundation of China under Grant No. 61572062, and the National Key Research and Development Program of China under Grant No. 2016YFB1000503.

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Beihang University, Beijing, 100191, China

    Weitao Wang, Yuebin Bai, Peng Feng & Jianpei Tantai

  2. Center for Energy Efficient Computing and Applications (CECA), Peking University, Beijing, 100871, China

    Jun Huang

  3. Department of Computer Science, State University of New York, Binghamton, NY, 13902, USA

    Mo Sha

Authors
  1. Weitao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuebin Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peng Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jun Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Mo Sha
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jianpei Tantai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuebin Bai.

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

Wang, W., Bai, Y., Feng, P. et al. DTN-Balance: A Forwarding-Capacity and Forwarding-Queue Aware Routing for Self-organizing DTNs. Wireless Pers Commun 118, 575–598 (2021). https://doi.org/10.1007/s11277-020-08033-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-020-08033-3

Keywords

Search

Navigation