Advertisement

Fair Comparative Analysis of Opportunistic Routing Protocols: An Empirical Study

  • Jay Gandhi
  • Zunnun NarmawalaEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1049)

Abstract

Fair comparative analysis of opportunistic routing protocols plays a vital role in selecting a suitable routing protocol for various applications of opportunistic networks. In this paper, we have analyzed the performance of the routing protocols, namely, EPIDEMIC, Spray and Wait, PROPHET, First Contact, Direct Delivery, MaxProp, WaveRouter, and LifeRouter. The ONE simulator is used for this empirical study. This study measures the performance of protocols based on Delivery Probability, Overhead Ratio, and Average Latency with different mobility models as well as real-world mobility traces. The simulation results surprisingly show that Spray and Wait outperform all the other protocols in almost all scenarios. Further, CAHM mobility model is able to mimic real-world mobility closely resembling real-world mobility traces of different network densities.

Keywords

Opportunistic networks Delay tolerant networks ONE simulator Routing protocols Real-world mobility traces Synthetic mobility models 

References

  1. 1.
    J. Dede, A. Förster, E. Hernández-Orallo, J. Herrera-Tapia, K. Kuladinithi, V. Kuppusamy et al., Simulating opportunistic networks: survey and future directions. IEEE Commun. Surv. Tutor. 20, 1547–1573 (2018)CrossRefGoogle Scholar
  2. 2.
    S. Bharamagoudar, S. Saboji, Routing in opportunistic networks: taxonomy, survey, in 2017 International Conference on Electrical, Electronics, Communication, Computer, and Optimization Techniques (ICEECCOT) (2017), pp. 300–305Google Scholar
  3. 3.
    A. Keränen, E. Hyytiä, J. Ott, M. Desta, T. Kärkkäinen, Evaluating (Geo) content sharing with the one simulator, in 11th ACM International Symposium on Mobility Management and Wireless Access (MobiWac’13) (2013)Google Scholar
  4. 4.
    R. Cavallari, S. Toumpis, R. Verdone, Analysis of hybrid geographic/delay-tolerant routing protocols for wireless mobile networks, in IEEE INFOCOM 2018-IEEE Conference on Computer Communications (2018), pp. 2321–2329Google Scholar
  5. 5.
    V.F.S. Mota, F.D. Cunha, D.F. Macedo, J.M.S. Nogueira, A.A.F. Loureiro, Protocols, mobility models and tools in opportunistic networks: a survey. Comput. Commun. 48, 5–19 (2014)CrossRefGoogle Scholar
  6. 6.
    A. Vahdat, D. Becker, Epidemic Routing for Partially Connected Ad hoc Networks (2000)Google Scholar
  7. 7.
    T. Spyropoulos, K. Psounis, C.S. Raghavendra, 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–259Google Scholar
  8. 8.
    A. Keränen, J. Ott, T. Kärkkäinen, The ONE simulator for DTN protocol evaluation, in Proceedings of the 2nd International Conference on Simulation Tools and Techniques (2009), p. 55Google Scholar
  9. 9.
    A. Lindgren, A. Doria, O. Schel, #233, Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7, 19–20 (2003)Google Scholar
  10. 10.
    J. Burgess, B. Gallagher, D. Jensen, B.N. Levine, Maxprop: Routing for vehicle-based disruption-tolerant networks, in 25th IEEE International Conference on Computer Communications. Proceedings INFOCOM (2006), pp. 1–11Google Scholar
  11. 11.
    Z. Narmawala, S. Srivastava, Community aware heterogeneous human mobility (cahm): model and analysis. Pervasive Mob. Comput. 21, 119–132 (2015)CrossRefGoogle Scholar
  12. 12.
    S. James, G. Richard, C. Jon, H. Pan, D. Christophe, C. Augustin, CRAWDAD dataset cambridge/haggle (v. 2009-05-29) ed (2009)Google Scholar
  13. 13.
    N. Eagle, A. Pentland, Reality mining: sensing complex social systems. Pers. Ubiquit. Comput. 10, 255–268 (2006)CrossRefGoogle Scholar
  14. 14.
    B. Greg, H. Tristan, R. Devan, B. Martin, B. Saleem, CRAWDAD dataset st_andrews/sassy (v. 2011-06-03) ed (2011)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Computer Science & EngineeringInstitute of Technology, Nirma UniversityAhmedabadIndia

Personalised recommendations