Skip to main content

Fair Comparative Analysis of Opportunistic Routing Protocols: An Empirical Study

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((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.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

References

  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)

    Article  Google Scholar 

  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–305

    Google Scholar 

  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. 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–2329

    Google Scholar 

  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)

    Article  Google Scholar 

  6. A. Vahdat, D. Becker, Epidemic Routing for Partially Connected Ad hoc Networks (2000)

    Google Scholar 

  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–259

    Google Scholar 

  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. 55

    Google Scholar 

  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. 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–11

    Google Scholar 

  11. Z. Narmawala, S. Srivastava, Community aware heterogeneous human mobility (cahm): model and analysis. Pervasive Mob. Comput. 21, 119–132 (2015)

    Article  Google Scholar 

  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. N. Eagle, A. Pentland, Reality mining: sensing complex social systems. Pers. Ubiquit. Comput. 10, 255–268 (2006)

    Article  Google Scholar 

  14. B. Greg, H. Tristan, R. Devan, B. Martin, B. Saleem, CRAWDAD dataset st_andrews/sassy (v. 2011-06-03) ed (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zunnun Narmawala .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gandhi, J., Narmawala, Z. (2020). Fair Comparative Analysis of Opportunistic Routing Protocols: An Empirical Study. In: Jain, L., Tsihrintzis, G., Balas, V., Sharma, D. (eds) Data Communication and Networks. Advances in Intelligent Systems and Computing, vol 1049. Springer, Singapore. https://doi.org/10.1007/978-981-15-0132-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-0132-6_20

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-0131-9

  • Online ISBN: 978-981-15-0132-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics