Skip to main content

Average Time Based PRoPHET Routing Protocol for Opportunistic Networks

  • Conference paper
  • First Online:
Advanced Network Technologies and Intelligent Computing (ANTIC 2022)

Abstract

An Opportunistic Network is an intermittently connected Mobile Ad-hoc Networks that exploits the communication opportunity between the nodes for data transmission whenever they are within the communication range of each other even for a short time. In contrast to the Mobile Ad-hoc Networks, Opportunistic Networks follow store-carry-forward approach for the data transmission. Routing in this type of network depends on many factors, like the direction of the node's movement, the supported interface bandwidth (Bluetooth, high-speed Internet, etc.), the node's speed, and the node's buffer size. In this research work, a context-aware routing protocol is proposed that uses the frequency of contacts among nodes as context information. The frequency of meetings between any two nodes is found to be a good heuristic to identify the message's best forwarder. The proposed routing protocol is simulated on opportunistic network environment (ONE) simulator and the results are compared with the most prominent routing protocols of context-oblivious and context-aware classes, and it was found that the proposed routing protocol performs better than other protocols in terms of delivery probability and buffer average time.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Single-copy routing in intermittently connected mobile networks. In: 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, IEEE SECON 2004, pp. 235–244. IEEE October 2004

    Google Scholar 

  2. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: Proceedings of the - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW 2007), 79–85 (2007). https://doi.org/10.1109/PERCOMW.2007.108

  3. Del Duca Almeida, V., Oliveira, A.B., MacEdo, D.F., Nogueira, J.M.S.: Performance evaluation of MANET and DTN routing protocols. In: IFIP Wireless Days (2012). https://doi.org/10.1109/WD.2012.6402866

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

    Google Scholar 

  5. Woungang, I., Dhurandher, S.K., Anpalagan, A., Vasilakos, A.V. (eds.): Routing in Opportunistic Networks, p. 83. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-3514-3

  6. Jindal, A., Psounis, K.: Contention-aware analysis of routing schemes for mobile opportunistic networks. In: MobiOpp 2007 Proceedings of the 1st International MobiSys Workshop on Mobile opportunistic Networking, pp. 1–8 (2007). https://doi.org/10.1145/1247694.1247696

  7. Dev, A.: Opportunistic network routing protocols. In: 2019 9th International Conference on Cloud Computing, Data Science & Engineering (Confluence), pp. 100–106 (2019)

    Google Scholar 

  8. Kumar Dhurandher, S., Kumar Sharma, D., Woungang, I.: Energy-based Performance Evaluation of Various Routing Protocols in Infrastructure-less Opportunistic Networks. http://www.scs.ryerson.ca/. Accessed 13 Oct 2022

  9. Bjurefors, F.: Opportunistic networking congestion, transfer ordering and resilience (2014)

    Google Scholar 

  10. Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. Comput. Commun. Rev. 34(4), 145–157 (2004). https://doi.org/10.1145/1030194.1015484

    Article  Google Scholar 

  11. Ramesh, S., Ganesh Kumar, P.: Opportunistic Network Environment simulator Department of Communications and Networking Special assignment (2008). https://scialert.net/fulltext/?doi=jai.2013.123.133#ab

  12. Kaur, N., Mathur, G.: Opportunistic networks: a review 18(2), 20–26 (2016). https://doi.org/10.9790/0661-1802032026

  13. Sharma, D.K., Kukreja, D., Aggarwal, P., Kaur, M., Sachan, A.: Poisson’s probability-based Q-routing techniques for message forwarding in opportunistic networks. Int. J. Commun. Syst. 31(11), 1–23 (2018). https://doi.org/10.1002/dac.3593

    Article  Google Scholar 

  14. Boldrini, C., Conti, M., Passarella, A.: Autonomic behaviour of opportunistic network routing. Int. J. Auton. Adapt. Commun. Syst. 1(1), 122–147 (2008). https://doi.org/10.1504/IJAACS.2008.019203

    Article  Google Scholar 

  15. Chen, L.J., Yu, C.H., Tseng, C.L., Chu, H.H., Chou, C.F.: A content-centric framework for effective data dissemination in opportunistic networks. IEEE J. Sel. Areas Commun. 26(5), 761–772 (2008). https://doi.org/10.1109/JSAC.2008.080603

    Article  Google Scholar 

  16. Akestoridis, D.G., Papapetrou, E.: A framework for the evaluation of routing protocols in opportunistic networks. Comput. Commun. 145, 14–28 (2019). https://doi.org/10.1016/j.comcom.2019.06.003

    Article  Google Scholar 

  17. Huang, C., Lan, K., Tsai, C., Architecture, A.: A survey of opportunistic networks, pp. 1672–1677 (2008). https://doi.org/10.1109/WAINA.2008.292

  18. Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications - SIGCOMM 2003 (2003). https://doi.org/10.1145/863955

  19. Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. 44(11), 134–141 (2006). https://doi.org/10.1109/MCOM.2006.248176

    Article  Google Scholar 

  20. Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 145–158, August 2004

    Google Scholar 

  21. Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report CS-2000-06, Computer Science Department. Duke University (2000)

    Google Scholar 

  22. De Rango, F., Amelio, S., Fazio, P.: Epidemic strategies in delay tolerant networks from an energetic point of view: main issues and performance evaluation. J. Netw. 10(01) (2015). https://doi.org/10.4304/JNW.10.01.4-14

  23. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the ACM SIGCOMM 2005 Workshop on Delay-Tolerant Networking, WDTN 2005 (2005), pp. 252–259. https://doi.org/10.1145/1080139.1080143

  24. Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. ACM Mob. Comput. Commun. Rev. 7, 19–20 (2003)

    Article  Google Scholar 

  25. Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: MaxProp: routing for vehicle-based disruption-tolerant networks. In: Proceedings of the IEEE INFOCOM (2006). https://doi.org/10.1109/INFOCOM.2006.228

  26. Wang, S.X.: The improved Dijkstra’s shortest path algorithm and its application. Procedia Eng. 29, 1186–1190 (2012). https://doi.org/10.1016/j.proeng.2012.01.110

    Article  Google Scholar 

  27. Dhurandher, S.K., Borah, S., Woungang, I., Sharma, D.K., Arora, K., Agarwal, D.: EDR: an encounter and distance based routing protocol for opportunistic networks. In: Proceedings of the International Conference on Advanced Information Networking and Applications AINA, vol. 2016, pp. 297–302, May 2016. https://doi.org/10.1109/AINA.2016.15

  28. Keranen, A.: Opportunistic network environment simulator. Special Assignment report, Helsinki University of Technology, Department of Communications and Networking (2008)

    Google Scholar 

  29. Verma, A., Verma, P., Dhurandher, S.K., Woungang, I. (eds.): Opportunistic Networks: Fundamentals, Applications and Emerging Trends. CRC Press, Taylor and Francis (2021). ISBN: 9780367677305

    Google Scholar 

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

    Article  Google Scholar 

  31. Singh, M., Verma, A., Verma, P.: Security in opportunistic networks. In: Opportunistic Networks: Fundamentals, Applications and Emerging Trends, Chapter 14, pp. 299–312. CRC Press (2021)

    Google Scholar 

  32. Verma, A., Singh, M., Pattanaik, K.K., Singh, B.K.: Future networks inspired by opportunistic network. In: Opportunistic Networks: Mobility Models, Protocols, Security & Privacy, Chapter 12, pp. 229–246. CRC Press, Taylor & Francis (2019). https://doi.org/10.1201/9780429453434

  33. Verma, A., Pattanaik, K.K.: Routing protocols in opportunistic networks. In: Opportunistic Networking: Vehicular, D2D and Cognitive Radio Networks, Chapter 5, pp. 125–166. CRC Press, Taylor and Francis (2017). https://doi.org/10.1201/9781315200804

  34. Verma, A., Pattanaik, K.K., Ingavale, A.: Context-based routing protocols for OppNets. In: Woungang, I., Dhurandher, S., Anpalagan, A., Vasilakos, A. (eds.) Routing in Opportunistic Networks, pp. 69–97. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-3514-3_3

  35. Singh, M., Verma, A., Verma, P.: Empirical analysis of the performance of routing protocols in opportunistic networks. In: Research Advances in Network Technologies. CRC Press (2023, in Press). ISBN 9781032340487

    Google Scholar 

Download references

Acknowledgment

This research work is part of the research work funded by “Seed Grant to Faculty Members under IoE Scheme (under Dev. Scheme No. 6031)” granted to Anshul Verma at Banaras Hindu University, Varanasi, India, and is also supported by Technology Innovation Hub, Indian Institute of Technology Patna, India.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anshul Verma .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 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

Gond, M.K., Singh, M., Verma, A., Verma, P. (2023). Average Time Based PRoPHET Routing Protocol for Opportunistic Networks. In: Woungang, I., Dhurandher, S.K., Pattanaik, K.K., Verma, A., Verma, P. (eds) Advanced Network Technologies and Intelligent Computing. ANTIC 2022. Communications in Computer and Information Science, vol 1797. Springer, Cham. https://doi.org/10.1007/978-3-031-28180-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-28180-8_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-28179-2

  • Online ISBN: 978-3-031-28180-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics