Skip to main content
SpringerLink
Log in

Comparative Analysis of Routing Algorithms in Opportunistic Network

  • Conference paper
  • First Online:
Advancements in Smart Computing and Information Security (ASCIS 2023)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 2039))

  • 31 Accesses

Abstract

Opportunistic networks are developed by connecting interfaces for short-range communication. Routing is difficult in this type of Network. The existing routing algorithms are discussed in this paper and comparison is shown for the five algorithms which are used wisely in this Network. The comparison is made in Epidemic routing, Spray and Wait, First Contact routing, Prophet routing and Maxprop routing. In the comparison, we can see that in all routing algorithms overhead ratio is decreasing when buffer size is increased. And due to increase in buffer size, the delivery probability is also increased. Each algorithm has its own advantages and disadvantages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Amazon. What is Computer Networking? - Beginner’s Guide to IT Networking - AWS. Amazon Web Services, Inc. https://aws.amazon.com/what-is/computer-networking/

  2. How are infrastructure and ad hoc networks different? https://manuals.konicaminolta.eu/ineo-4020/EN/ntwk_guide/types-wireless-networks-topic.html#:~:text=Wireless%20networks%20can%20operate%20in. Accessed 09 Oct 2023

  3. Wireless ad hoc network. Wikipedia (2023). https://en.wikipedia.org/wiki/Wireless_ad_hoc_network#:~:text=A%20wireless%20ad%20hoc%20network. Accessed 09 Oct 2023

  4. M. P. W. F. L. writer M. P. has 5+ years’ experience writing about consumer-oriented technology and is an expert telecommuter our editorial process M. Pinola. Features and Uses of an Ad Hoc Wireless Network. Lifewire. https://www.lifewire.com/what-is-an-ad-hoc-wireless-network-2377409

  5. Social network. Wikipedia (2021). https://en.wikipedia.org/wiki/Social_network#:~:text=A%20social%20network%20is%20a

  6. Wikipedia Contributors. Mobile social network. Wikipedia (2019). https://en.wikipedia.org/wiki/Mobile_social_network

  7. Vidhya Lakshmi, V.R., Gireesh, K.T.: Opportunistic mobile social networks: architecture, privacy, security issues and future directions. Int. J. Electr. Comput. Eng. (IJECE) 9(2), 1145 (2019). https://doi.org/10.11591/ijece.v9i2.pp1145-1152

  8. Opportunistic mobile social network. Wikipedia (2022). https://en.wikipedia.org/wiki/Opportunistic_mobile_social_network#:~:text=Opportunistic%20mobile%20social%20networks%20are. Accessed 09 Oct 2023

  9. Gumaste, S., Kharat, M., Thakare, V.M., Kharat, V.: Routing algorithm: an overview. Int. J. Innov. Eng. Manag. 2(1), 61–73 (2013). ISSN 2319-3344

    Google Scholar 

  10. Cai, Y., Zhang, H., Fan, Y., Xia, H.: A survey on routing algorithms for opportunistic mobile social networks. China Commun. 18(2), 86–109 (2021). https://doi.org/10.23919/jcc.2021.02.007

    Article  Google Scholar 

  11. Wang, R., Wang, Z., Ma, W., Deng, S., Huang, H.: Epidemic routing performance in DTN with selfish nodes. IEEE Access 7, 65560–65568 (2019). https://doi.org/10.1109/access.2019.2916685

    Article  Google Scholar 

  12. Darmani, Y., Karimi, S.: Message overhead control using P-epidemic routing method in resource-constrained heterogeneous DTN (2021). https://doi.org/10.1109/icee52715.2021.9544149

  13. Hu, Y., Tian, T., Zhang, F., Chen, Q., Yu, G., Ma, D.: Restricted epidemic routing method in large-scale delay tolerant networks. In: 2021 IEEE 21st International Conference on Communication Technology (ICCT) (2021). https://doi.org/10.1109/icct52962.2021.9657947

  14. Rashidi, L., Dalili-Yazdi, A., Entezari-Maleki, R., Sousa, L., Movaghar, A.: Modeling epidemic routing: capturing frequently visited locations while preserving scalability. IEEE Trans. Veh. Technol. 1 (2021). https://doi.org/10.1109/tvt.2021.3057541

  15. Datta, S., Roy, M., Kar, P.: Application of IoT in smart epidemic management in context of Covid-19 (2021). https://doi.org/10.1109/hpsr52026.2021.9481844

  16. Singha, S., Jana, B., Jana, S.H., Mandal, N.K.: A survey to analyse routing algorithms for opportunistic network. Procedia Comput. Sci. 171, 2501–2511 (2020). https://doi.org/10.1016/j.procs.2020.04.271

    Article  Google Scholar 

  17. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait. In: Proceeding of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, WDTN 2005 (2005). https://doi.org/10.1145/1080139.1080143

  18. Cui, J., Chen, H., Chang, Y., Chen, Z., Gong, S., Yang, Y.: An improved spray-and-wait routing algorithm based on social relationship between nodes in DTN. In: 2022 IEEE 19th International Conference on Mobile Ad Hoc and Smart Systems (MASS) (2022). https://doi.org/10.1109/mass56207.2022.00017

  19. Cui, J., Gong, S., Chang, Y., Chen, Z., Chen, H., Yang, Y.: An improved spray and wait algorithm based on the node social tree (2023). https://doi.org/10.1109/icpads56603.2022.00017

  20. Cui, J., Cao, S., Chang, Y., Wu, L., Liu, D., Yang, Y.: An adaptive spray and wait routing algorithm based on quality of node in delay tolerant network. IEEE Access 7, 35274–35286 (2019). https://doi.org/10.1109/access.2019.2904750

    Article  Google Scholar 

  21. Misra, S., Pal, S., Saha, B.K.: Distributed information-based cooperative strategy adaptation in opportunistic mobile networks. IEEE Trans. Parallel Distrib. Syst. 26(3), 724–737 (2015). https://doi.org/10.1109/tpds.2014.2314687

    Article  Google Scholar 

  22. Sok, P., Kim, K.: PRoPHET routing based on distance mechanism in disruption-tolerant network (2014). https://doi.org/10.1145/2557977.2558024

  23. Xue, J., Li, J., Cao, Y., Fang, J.: Advanced PROPHET routing in delay tolerant network. IEEE Xplore (2009). https://ieeexplore.ieee.org/abstract/document/5076883?casa_token=-HqdrhHLDRAAAAAA:HIrxTHPoJIHFo3u95HpjBMo85Y7EPc1xtGq5PQJg-DM0FMefW_Syh0xevOtlE3OcSJYFGPb6wy-3. Accessed 15 Apr 2022

  24. Venkat Das, M., Sarkar, S., Shahid: TTL based MaxProp routing protocol (2016). https://doi.org/10.1109/iccitechn.2016.7860159

  25. Abbas, S., Ahmad, K.: Opportunistic routing protocols based on fuzzy logic: present and future directions (2021). https://doi.org/10.1109/icais50930.2021.9395955

  26. Chen, J., Xu, G., Wu, X., Feng-qi, W., He, L.: Energy balance and cache optimization routing algorithm based on communication willingness (2021). https://doi.org/10.1109/wcnc49053.2021.9417387

  27. Zhao, Y., Srivastava, G.: A wireless mesh opportunistic network routing algorithm based on trust relationships. IEEE Access 10, 4786–4793 (2022). https://doi.org/10.1109/access.2021.3138370

    Article  Google Scholar 

  28. Li, N., Yan, J., Zhang, Z., Martínez-Ortega, J.-F., Yuan, X.: Geographical and topology control-based opportunistic routing for ad hoc networks. IEEE Sens. J. 21(6), 8691–8704 (2021). https://doi.org/10.1109/jsen.2021.3049519

    Article  Google Scholar 

  29. Hui, P., Crowcroft, J., Yoneki, E.: BUBBLE rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10(11), 1576–1589 (2011). https://doi.org/10.1109/tmc.2010.246

    Article  Google Scholar 

  30. Nelson, S., Bakht, M., Kravets, R.: Encounter-based routing DTNs. In: Proceedings of the IEEE INFOCOM, pp. 846–854 (2009). https://doi.org/10.1109/INFCOM.2009.5061994

  31. Aneja, M., Garg, V.: Simulation of epidemic, spray and wait and first contact routing protocols in delay tolerant network. IOSR J. Electron. Commun. Eng. (IOSR-JECE). https://www.iosrjournals.org/iosr-jece/papers/AETM'15_ECE/06-ECE-173.pdf

  32. Poonguzharselvi, B., Vetriselvi, V.: Survey on routing algorithms in opportunistic networks. In: International Conference on Computer Communication and Informatics (2013). https://doi.org/10.1109/iccci.2013.6466129

  33. Popat, K.A., Sharma, P.: Opportunistic location update—a novel cost efficient reactive approach to remove pauses in cellular networks. In: Modi, N., Verma, P., Trivedi, B. (eds.) ComNet 2016. AISC, vol. 508, pp. 459–467. Springer, Singapore (2017). https://doi.org/10.1007/978-981-10-2750-5_48

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Marwadi University, Rajkot, Gujarat, India

    Riddhi A. Joshi & Kalpesh A. Popat

Authors
  1. Riddhi A. Joshi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kalpesh A. Popat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Riddhi A. Joshi .

Editor information

Editors and Affiliations

  1. Marwadi University, Rajkot, India

    Sridaran Rajagopal

  2. Marwadi University, Rajkot, Gujarat, India

    Kalpesh Popat

  3. Marwadi University, Rajkot, Gujarat, India

    Divyakant Meva

  4. Marwadi University, Rajkot, Gujarat, India

    Sunil Bajeja

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Joshi, R.A., Popat, K.A. (2024). Comparative Analysis of Routing Algorithms in Opportunistic Network. In: Rajagopal, S., Popat, K., Meva, D., Bajeja, S. (eds) Advancements in Smart Computing and Information Security. ASCIS 2023. Communications in Computer and Information Science, vol 2039. Springer, Cham. https://doi.org/10.1007/978-3-031-59100-6_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-59100-6_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-59099-3

  • Online ISBN: 978-3-031-59100-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation