Skip to main content
Log in

Encounter Count and Interaction Time-Based Routing Protocol for Opportunistic Networks

  • Original Research
  • Published:
SN Computer Science Aims and scope Submit manuscript

Abstract

Opportunistic network is an extension of Mobile Ad-hoc network, and therefore, it shares most of the properties of the Mobile Ad-hoc network except routing protocols. Highly intermittent connections between nodes in opportunistic networks make the development of routing protocols more challenging. This paper proposes an Encounter Count and Interaction Time-based (ECIT) routing protocol for opportunistic networks that combines context information and effective buffer technique to reduce overhead as well as to improve delivery rates. The ECIT routing protocol uses context information of nodes and neighbourhoods to select the next forwarding node for a message in the network. A buffer management policy is also added to improve efficiency of selection of the next forwarding node. Further, the proposed routing protocol is compared with well-known routing protocols of opportunistic networks, i.e., Epidemic, Probabilistic Routing Protocol using History of Encounters and Transitivity (PRoPHET), and PRoPHETv2. Opportunistic Network Environment Simulator (ONE) is used for the implementation of the proposed routing protocol. Simulation results and analysis show that out of the three existing routing protocols, the PRoPHETv2 performs better than the other two. Whereas, the proposed routing protocol performs even better than PRoPHETv2 in terms of delivery probability by 32% and the overhead ratio by 22.1%, respectively.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Sachdeva R, Dev A. Review of opportunistic network: assessing past, present, and future. Int J Commun Syst. 2021;34(11):4860.

    Article  Google Scholar 

  2. Dalal R, Khari M, Anzola JP, García-Díaz V. Proliferation of opportunistic routing: a systematic review. IEEE Access. 2021;10:5855–83.

    Article  Google Scholar 

  3. Singh M, Verma P, Verma A. Security in opportunistic networks. In: Opportunistic networks. CRC Press; 2021. p. 299–312.

    Chapter  Google Scholar 

  4. Alajeely M, Doss R, Ahmad A. Security and trust in opportunistic networks—a survey. IETE Tech Rev. 2016;33(3):256–68.

    Article  Google Scholar 

  5. Rashidibajgan S, Hupperich T, Doss R, Förster A. Secure and privacy-preserving structure in opportunistic networks. Comput Secur. 2021;104: 102208.

    Article  Google Scholar 

  6. Verma A, Verma P, Farhaoui Y, Lv Z. Emerging real-world applications of internet of things. CRC Press; 2022. https://doi.org/10.1201/9781003304203.

    Book  Google Scholar 

  7. Rudra B, Verma A, Verma S, Shrestha B. Futuristic research trends and applications of internet of things. CRC Press; 2022. https://doi.org/10.1201/9781003304203.

    Book  Google Scholar 

  8. Verma A, Singh M, Pattanaik K, Singh B. Future networks inspired by opportunistic networks. In: Oppor Netw. London: Chapman and Hall/CRC; 2018. p. 230–46.

    Chapter  Google Scholar 

  9. Verma A, Pattanaik KK, Ingavale A. In: Woungang I, Dhurandher SK, Anpalagan A, Vasilakos AV (eds) Context-based routing protocols for OppNets. New York: Springer New York; 2013. pp. 69–97. https://doi.org/10.1007/978-1-4614-3514-3_3.

  10. Vahdat A, Becker D, et al. Epidemic routing for partially connected ad hoc networks 2000.

  11. Spyropoulos T, Psounis K, Raghavendra CS. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, 2005:pp. 252–259.

  12. Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks. In: Service Assurance with Partial and Intermittent Resources: First International Workshop, SAPIR 2004, Fortaleza, Brazil, August 19–6, 2004. Proceedings, Springer, 2004:pp. 239–254.

  13. Ajjaj S, El Houssaini S, Hain M, El Houssaini M-A. Performance assessment and modeling of routing protocol in vehicular ad hoc networks using statistical design of experiments methodology: A comprehensive study. Appl Syst Innov. 2022. https://doi.org/10.3390/asi5010019.

    Article  Google Scholar 

  14. Ajjaj S, El Houssaini S, Hain M, El Houssaini M-A. A new approach for evaluating the performance of Aodv routing protocol in vanets using the Plackett–Burman method. In: Digital Technologies and Applications: Proceedings of ICDTA 21, Fez, Morocco, Springer. 2021:pp. 1021–1032.

  15. Verma A, Srivastava DA. Integrated routing protocol for opportunistic networks. Int J Adv Comput Sci Appl. 2011;2(3):85–92. https://doi.org/10.14569/JACSA.2011.020315.

    Article  Google Scholar 

  16. Verma A, Pattanaik K. Routing protocols in opportunistic networks. In: Opportunistic networking: vehicular, D2D and cognitive radio networks. 1st ed. London: Taylor Francis Group/CRC Press; 2017. p. 123–66. https://doi.org/10.1201/9781315200804.

    Chapter  Google Scholar 

  17. Verma A, Verma P, Dhurandher SK, Woungang I. Opportunistic networks: fundamentals, applications and emerging trends. CRC Press; 2021.

    Book  Google Scholar 

  18. Grasic S, Davies E, Lindgren A, Doria A. The evolution of a dtn routing protocol-prophetv2. In: Proceedings of the 6th ACM Workshop on Challenged Networks, 2011:pp. 27–30.

  19. Lakshmi VRV, Gireesh KT. Opportunistic mobile social networks: architecture, privacy, security issues and future directions. Int J Electr Comput Eng. 2019;9(2):1145–52.

    Google Scholar 

  20. Cheng G, Mei S, Zhang Y, Xing Y-H, Bao X-Y. Routing protocol based on social characteristics for opportunistic networks. J China Univ Posts Telecommun. 2014;21(1):67–103.

    Article  Google Scholar 

  21. Lenando H, Alrfaay M. Epsoc: social-based epidemic-based routing protocol in opportunistic mobile social network. Mob Inform Syst. 2018;2018:1–8.

    Google Scholar 

  22. Rachman ZA, Maharani W, et al. The analysis and implementation of degree centrality in weighted graph in social network analysis. In: 2013 International Conference of Information and Communication Technology (ICoICT), 2013:pp. 72–76. IEEE.

  23. Borah SJ, Dhurandher SK, Woungang I, Kumar V. A game theoretic context-based routing protocol for opportunistic networks in an iot scenario. Comput Netw. 2017;129:572–84.

    Article  Google Scholar 

  24. Qin Y, Li L, Liu H, Gtr: a novel routing scheme based on game theory in opportunistic networks. In: 2014 IEEE/CIC International Conference on Communications in China, ICCC 2015;2014:775–779. https://doi.org/10.1109/ICCChina.2014.7008381.

  25. Ahmad K, Fathima M, Jain V, Fathima A. Fuzzy-prophet: a novel routing protocol for opportunistic network. Int J Inform Technol. 2017;9:121–7.

    Google Scholar 

  26. Khalid K, Woungang I, Dhurandher SK, Singh J, Barolli L. A fuzzy-based check-and-spray geocast routing protocol for opportunistic networks. J High Speed Netw. 2021;27(1):1–12.

    Article  Google Scholar 

  27. Sharma DK, Dhurandher SK, Woungang I, Srivastava RK, Mohananey A, Rodrigues JJ. A machine learning-based protocol for efficient routing in opportunistic networks. IEEE Syst J. 2016;12(3):2207–13.

    Article  Google Scholar 

  28. Sharma DK, Sharma A, Kumar J, et al. Knnr: K-nearest neighbour classification based routing protocol for opportunistic networks. In: 2017 Tenth International Conference on Contemporary Computing (IC3), 2017;pp. 1–6. IEEE.

  29. Yao M-H, Bao X-I, Zhang S, Wang Y, Shi Z-J. Opportunistic networks model with restricted time-space. Procedia Comput Sci. 2017;107:608–17. https://doi.org/10.1016/j.procs.2017.03.162. (Advances in Information and Communication Technology: Proceedings of 7th International Congress of Information and Communication Technology (ICICT2017)).

    Article  Google Scholar 

  30. Pirozmand P, Wu G, Jedari B, Xia F. Human mobility in opportunistic networks: characteristics, models and prediction methods. J Netw Comput Appl. 2014;42:45–58.

    Article  Google Scholar 

  31. Fathima M, Ahmad K, Fathima A. Mobility models and routing protocols in opportunistic networks: a survey. Int J Adv Res Comput Sci. 2017;8(5).

  32. Shahzamal M, Pervez M, Zaman M, Hossain M. Mobility models for delay tolerant network: a survey. Int J Wirel Mob Netw (IJWMN) 2014;6.

  33. Dhurandher SK, Borah S, Woungang I, Sharma DK, Arora K, Agarwal D. Edr: an encounter and distance based routing protocol for opportunistic networks. In: 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA), 2016:pp. 297–302. IEEE

  34. Spyropoulos T, Psounis K, Raghavendra CS. Single-copy routing in intermittently connected mobile networks. In: 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004., 2004:pp. 235–244. IEEE.

  35. Sati S, Probst C, Graffi K. Analysis of buffer management policies for opportunistic networks. In: 2016 25th International Conference on Computer Communication and Networks (ICCCN), 2016:pp. 1–8. IEEE.

  36. Singh M, Verma A, Verma P. Empirical analysis of the performance of routing protocols in opportunistic networks. In: Research advances in network technologies. London: CRC Press; 2023. p. 257–72.

    Chapter  Google Scholar 

  37. Khalid K, Woungang I, Dhurandher SK, Barolli L, Carvalho GH, Takizawa M. An energy-efficient routing protocol for infrastructure-less opportunistic networks. In: 2016 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), 2016;pp. 237–244. IEEE.

  38. Alenazi MJ, Cheng Y, Zhang D, Sterbenz JP. Epidemic routing protocol implementation in ns-3. In: Proceedings of the 2015 Workshop on Ns-3, 2015;pp. 83–90.

  39. Keränen A, Ott J, Kärkkäinen T. The one simulator for dtn protocol evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, 2009:pp. 1–10.

  40. Keränen A, Kärkkäinen T, Ott J. Simulating mobility and dtns with the one. J Commun. 2010;5(2):92–105.

    Article  Google Scholar 

  41. Fraire JA, Madoery P, Raverta F, Finochietto JM, Velazco R. Dtnsim: Bridging the gap between simulation and implementation of space-terrestrial dtns. In: 2017 6th International Conference on Space Mission Challenges for Information Technology (SMC-IT), 2017;pp. 120–123. https://doi.org/10.1109/SMC-IT.2017.27.

  42. Udugama A, Förster A, Dede J, Kuppusamy V. Simulating opportunistic networks with omnet++. In: Recent advances in network simulation: the OMNeT++ environment and its ecosystem. Cham: Springer; 2019. p. 425–49.

    Chapter  Google Scholar 

  43. Denda R, Banchs A, Effelsberg W. The fairness challenge in computer networks. In: Quality of Future Internet Services: First COST 263 International Workshop, QofIS 2000 Berlin, Germany, September 25–26, 2000 Proceedings 1. Springer, 2000:pp. 208–220.

  44. Shi H, Prasad RV, Onur E, Niemegeers IGMM. Fairness in wireless networks: issues, measures and challenges. IEEE Commun Surv Tutor. 2014;16(1):5–24. https://doi.org/10.1109/SURV.2013.050113.00015.

    Article  Google Scholar 

Download references

Funding

This research work is funded by “Seed Grant to Faculty Members under IoE Scheme (under Dev. Scheme No. 6031)” awarded to Anshul Verma.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohini Singh.

Ethics declarations

Conflict of Interest

The authors declare that they have no conflict of interest.

Ethical Approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

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

This article is part of the topical collection “Research Trends in Communication and Network Technologies” guest edited by Anshul Verma, Pradeepika Verma, and Kiran Kumar Pattanaik.

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

Singh, M., Verma, A. & Verma, P. Encounter Count and Interaction Time-Based Routing Protocol for Opportunistic Networks. SN COMPUT. SCI. 5, 43 (2024). https://doi.org/10.1007/s42979-023-02354-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s42979-023-02354-3

Keywords

Navigation