Advertisement

A probabilistic home-based routing scheme for delay tolerant networks

  • Abdullah Alhasanat
  • Mohanad Alhasanat
  • Saud AlthunibatEmail author
  • Khaled Matrouk
Article

Abstract

In traditional Mobile Adhoc Networks routing algorithms, the existence of a sustainable path between the source and destination is a crucial issue. These algorithms are shown to be unsuccessful in Delay Tolerant Networks (DTNs) since the network is almost disrupted, and then such a path is not guaranteed. Although Store-and-Forward routing approach has provided an adequate solution for these networks, it suffers from the large end-to-end delay and the additional traffic and communication costs incurring the network. This study presents an efficient single-copy home-based routing scheme for DTNs. Two different scenarios, referred as blind and semi-blind, are considered based on the amount of available knowledge about the destination. Simulation results presented in this paper demonstrate that the performance of the proposed scheme is closely approaching the unrestricted flooding algorithm, the Epidemic. Moreover, the proposed scheme provides a low communication cost, an outstanding end-to-end delay and a high successful delivery ratio as compared to state-of-art algorithms.

Keywords

Mobile adhoc networks Delay tolerant networks Social routing 

Notes

References

  1. 1.
    Wood, L., Eddy, W., & Holliday, P. (2009). A bundle of problems. In 2009 IEEE aerospace conference proceedings (p. 117). Piscataway.Google Scholar
  2. 2.
    Warthman, F. (2003). Delay-Tolerant Networks (DTNs): A tutorial, version 1.1, 3/5/03.Google Scholar
  3. 3.
    Voyiatzis, A. G. (2012). A survey of delay- and disruption-tolerant networking applications. Journal of Internet Engineering, 5(1), 331–344.Google Scholar
  4. 4.
    Nedenshi, S., & Patra, R. (2004). DTNLite: A reliable data transfer architecture for sensor networks. In 8th international conference on intelligent engineering systems Google Scholar
  5. 5.
    Mukhtar, O., & Ott, J. (2006). Backup and bypass: Introducing DTN-based ad-hoc networking to mobile phones. In Proceedings of the 2nd international workshop on multi-hop Ad hoc networks: From theory to reality (REALMAN 06) (pp. 107–109). New York: ACM.Google Scholar
  6. 6.
    CC, S., Raychoudhury, V., Marfia, G., & Singla, A. (2016). A survey of routing and data dissemination in Delay Tolerant Networks. Journal of Network and Computer Application, 67, 128–146.CrossRefGoogle Scholar
  7. 7.
    Hom, J., Good, L., & Yang, S. (2017). A survey of social-based routing protocols in delay tolerant networks. In Accepted in 2017 international conference on computing, networking, and communication (ICNC): Workshop.Google Scholar
  8. 8.
    Zhu, Y., Xu, B., Shi, X., & Wang, Y. (2013). A survey of social-based routing in delay tolerant networks: Positive and negative social effects. IEEE Communication Surveys and Tutorials, 15(1), 387–401.CrossRefGoogle Scholar
  9. 9.
    Xiao, M., Wu, J., & Huang, L. (2015). Home-based zero-knowledge multi-copy routing in mobile social networks. IEEE Transaction on Parallel and Distributed Systems, 26(5), 1238–1250.CrossRefGoogle Scholar
  10. 10.
    Jing, T., Liu, Y., Huo, Y., & Wen, Y. (2016). Home-based multi-copy routing in mobile social networks. In 2016 12th international conference on mobile Ad-Hoc and sensor networks (pp. 284–289).Google Scholar
  11. 11.
    Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Durst, B., et al. (2003). Delay-tolerant networking: An approach to interpanetary internet. IEEE Comm. Magazine, 41(6), 128–136.CrossRefGoogle Scholar
  12. 12.
    Zhang, H., Wan, L., Chen, Y., Yang, LT, & Peng, L. (2017). Adaptive message routing and replication in mobile opportunistic networks for connected communities. ACM Transactions on Internet Technology (TOIT) 18(1)Google Scholar
  13. 13.
    Caini, C., Cornice, P., Firrincieli, R., & Livini, M. (2009). DTNperf 2: A performance evaluation tool for delay/disruption tolerant networking. In Proceedings of the international conference on ultra modern telecommunications, ICUMT 2009 (p. 16). St. Petersburg. IEEE.Google Scholar
  14. 14.
    Schoeneich, R. O., & Surgiewicz, R. (2016). SocialRouting: The social-based routing algorithm for delay tolerant networks. International Journal of Electronics and Telecommunications, 62(2), 167172.Google Scholar
  15. 15.
    Nguyen, N. P., Dinh, T. N., Tokala, S., & Thai, M. T. (2011). Overlapping communities in dynamic networks: their detection and mobile applications. In Proceedings 17th ACM annual international conference on Mobile computing and networking (MobiCom 11).Google Scholar
  16. 16.
    Daly, E., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant MANETs. In Proceedings of ACM MobiHoc (p. 3240).Google Scholar
  17. 17.
    Kim, C., Kang, I., Han, Y., & Jeong, Y. (2013). An efficient routing scheme based on social relations in delay-tolerant networks. In The ubiquitous information and technologies and applications: CUTE (pp. 533–540). Heidelberg: Springer.Google Scholar
  18. 18.
    Gondaliya, N., & Kathiriya, D. (2016). Community detection using inter contact time and social characteristics based single copy routing in delay tolerant networks. International Journal of Ad hoc, Sensor and Ubiquitous Computing, 7(1), 21–35.CrossRefGoogle Scholar
  19. 19.
    Ravaei, B., Sabaei, M., Pedram, H., & Valaee, S. (2017). Community-aware single-copy content forwarding in Mobile Social Network. Wireless Networks, 1–17.Google Scholar
  20. 20.
    Wang, Y., Yang, W., & Wu, J. Analysis of a hypercube-based social feature multipath routing in delay tolerant networks. IEEE Transactions on Parallel and Distributed Systems, 24(9), 1706–1716.Google Scholar
  21. 21.
    Chang, J., & Chen, C. (2014). CROP: Community relevance-based opportunistic routing in delay tolerant networks. IEICE Transactions on Communications, E97–B(9), 1875–1888.CrossRefGoogle Scholar
  22. 22.
    Chen, H., & Lou, W. (2015). Contact expectation based routing for delay tolerant networks. Ad Hoc Networks, 36(1), 244–257.Google Scholar
  23. 23.
    Miao, J., Hasan, O., Mokhtar, S. B., Brunie, L., & Gianini, G. (2014). A delay and cost balancing protocol for message routing in mobile delay tolerant networks. Ad Hoc Networks, 24(B), 430–443.Google Scholar
  24. 24.
    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 (pp. 252–259). ACM.Google Scholar
  25. 25.
    Kim, S., Choi, J., & Yang, S. (2015). Hotspot: Location-based forwarding scheme in an opportunistic network. Ad Hoc & Sensor Wireless Network, 26(14), 151170.Google Scholar
  26. 26.
    Hui, P., Crowcroft, J., & Yoneki, E. (2008). Bubble rap: Socialbased forwarding in delay tolerant networks. IEEE Transaction on Mobile Computing, 10(11), 15761589.Google Scholar
  27. 27.
    Mei, A., Morabitto, G., Santi, P., & Stefa, J. (2011). Social-aware stateless forwarding in pocket switched networks. In Proceedings of IEEE INFOCOM (p. 251255).Google Scholar
  28. 28.
    Hui, P., & Crowcroft, J. (2007). How small labels create big improvements. In Proceedings of pervasive computing and communications workshops (p. 244251).Google Scholar
  29. 29.
    Boldrini, C., Conti, M., & Passarella, A. (2008). Exploiting users social relations to forward data in opportunistic networks: The HiBop solution. Pervasive and Mobile Computing, 4(5), 633657.CrossRefGoogle Scholar
  30. 30.
    Kim, S. K., Lee, J., & Yang, S. B. (2016). A social overlay-based forwarding scheme for mobile social networks. Wireless Networks, 22(7), 2439–2451.CrossRefGoogle Scholar
  31. 31.
    Zhao, R., Wang, X., Zhang, L., & Lin, Y. (2017). A socialaware probabilistic routing approach for mobile opportunistic social networks. Transactions on Emerging Telecommunications Technologies, 28(12).Google Scholar
  32. 32.
    Yue, Hao, Fu, Huai-Lei, & Guo, Linke (2013). An efficient prediction-based routing protocol in delay tolerant networks. In Globecom Workshops (GC Wkshps), 2013 IEEE (pp. 4471–4476).Google Scholar
  33. 33.
    Yuan, Q., Cardei, I., & Wu, J. (2012). An efficient prediction-based routing in disruption-tolerant networks. Transactions on Parallel and Distributed Systems, 23(1), 19–31.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Computer EngineeringAl-Hussein Bin Talal UniversityMa’anJordan
  2. 2.Department of Communications EngineeringAl-Hussein Bin Talal UniversityMa’anJordan
  3. 3.Department of Electrical and Computer Engineering, College of Engineering and ArchitectureUniversity of NizwaNizwaOman

Personalised recommendations