Skip to main content

Simulating Opportunistic Networks with OMNeT++

  • Chapter
  • First Online:
Recent Advances in Network Simulation

Part of the book series: EAI/Springer Innovations in Communication and Computing ((EAISICC))

Abstract

In this chapter, we focus on how to simulate Opportunistic Networks (OppNets) in OMNeT++. After defining what OppNets are and how they are different from other networking concepts, we detail, one by one, the necessary models for simulating them, such as mobility, network traffic, user behavior, and communication models focusing on the framework that we have built to simulate OppNets called Opportunistic Protocol Simulator (OPS). Furthermore, we pay special attention to various data dissemination models and the metrics required to evaluate OppNets. Towards the end, we provide a tutorial on setting up and using OPS with two use cases that include the different parameters configured to simulate these use cases and an analysis of the results.

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 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    The MiXiM project has been discontinued, and its contents have been merged into the INET Framework. New projects should be based on a recent version of INET instead of MiXiM.

  2. 2.

    https://www.nsnam.org.

  3. 3.

    https://akeranen.github.io/the-one.

  4. 4.

    https://npapanik.github.io/Adyton.

  5. 5.

    OPS Github repository: https://github.com/ComNets-Bremen/OPS/.

  6. 6.

    OPS Github repository: https://github.com/ComNets-Bremen/OPS/.

  7. 7.

    https://www.opengarden.com/.

  8. 8.

    https://crawdad.org.

  9. 9.

    BonnMotion website: http://sys.cs.uos.de/bonnmotion/.

  10. 10.

    http://www.ansim.info.

  11. 11.

    https://ns2simulator.com.

  12. 12.

    OPS Github repository: https://github.com/ComNets-Bremen/OPS/.

References

  1. Aschenbruck, N., Ernst, R., Gerhards-Padilla, E., Schwamborn, M.: Bonnmotion: a mobility scenario generation and analysis tool. In: Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, SIMUTools ’10, pp. 51:1–51:10. ICST, Brussels (2010)

    Google Scholar 

  2. Boldrini, C., Conti, M., Jacopini, J., Passarella, A.: Hibop: a history based routing protocol for opportunistic networks. In: 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp. 1–12. IEEE, Piscataway (2007)

    Google Scholar 

  3. Dede, J., Förster, A., Hernández-Orallo, E., Herrera-Tapia, J., Kuladinithi, K., Kuppusamy, V., Manzoni, P., bin Muslim, A., Udugama, A., Vatandas, Z.: Simulating opportunistic networks: survey and future directions. IEEE Commun. Surv. Tutorials 20(2), 1547–1573 (2018)

    Google Scholar 

  4. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 1–12. ACM, New York (1987)

    Google Scholar 

  5. Förster, A., Udugama, A., Görg, C., Kuladinithi, K., Timm-Giel, A., Cama-Pinto, A.: A novel data dissemination model for organic data flows. In: 7th EAI International Conference on Mobile Networks and Management (MONAMI), Santander. Springer, Cham (2015)

    Google Scholar 

  6. Förster, A., Muslim, A.B., Udugama, A.: Reactive user behavior and mobility models. In: Proceedings of the 4th OMNeT++ Community Summit. University of Bremen, Bremen (2017). http://arxiv.org/abs/1709.06395

  7. Förster, A., Bin Muslim, A., Udugama, A.: Trails–a trace-based probabilistic mobility model. In: Proceedings of the 21st ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM). ACM, New York (2018)

    Google Scholar 

  8. Haeupler, B.: Simple, fast and deterministic gossip and rumor spreading. J. ACM 62(6), 47 (2015)

    Article  MathSciNet  Google Scholar 

  9. Helgason, O.R., Jónsson, K.V.: Opportunistic networking in OMNeT+ +. In: Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, Networks and Systems and Workshops, Simutools 2008, Marseille, March 03–07. ICST, Brussels (2008)

    Google Scholar 

  10. Helgason, O.R., Kouyoumdjieva, S.T.: Enabling multiple controllable radios in OMNeT++ nodes. In: Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques (SIMUTools) (2011)

    Google Scholar 

  11. Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10(11), 1576–1589 (2011)

    Article  Google Scholar 

  12. 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, Simutools ’09, pp. 55:1–55:10. ICST, Brussels (2009)

    Google Scholar 

  13. Kouyoumdjieva, S.T., Chupisanyarote, S., Helgason, O.R., Karlsson, G.: Caching strategies in opportunistic networks. In: Proceedings of the IEEE International Symposium on World of Wireless, Mobile and Multimedia Networks, WoWMoM 2012, San Francisco, CA (2012)

    Google Scholar 

  14. Legion: Legion studio [online]. http://www.legion.com. Accessed 03 April 2017

  15. Leontiadis, I., Mascolo, C.: Geopps: geographical opportunistic routing for vehicular networks. In: 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp. 1–6. IEEE, Piscataway (2007). https://doi.org/10.1109/WOWMOM.2007.4351688

  16. Lindgren, A., Doria, A., Davies, E.B., Grasic, S.: Probabilistic Routing Protocol for Intermittently Connected Networks. RFC 6693 (2012). https://doi.org/10.17487/rfc6693. https://rfc-editor.org/rfc/rfc6693.txt

  17. Mikhaylov, K., Plevritakis, N., Tervonen, J.: Performance analysis and comparison of bluetooth low energy with IEEE 802.15.4 and simpliciTI. J. Sens. Actuator Netw. 2(3), 589–613 (2013)

    Google Scholar 

  18. Musolesi, M., Hailes, S., Mascolo, C.: Adaptive routing for intermittently connected mobile ad hoc networks. In: Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks, pp. 183–189. IEEE, Piscataway (2005)

    Google Scholar 

  19. Papanikos, N., Akestoridis, D.G., Papapetrou, E.: Adyton: a network simulator for opportunistic networks [online]. https://github.com/npapanik/Adyton (2015)

  20. Sang, L., Kuppusamy, V., Förster, A., Udugama, A., Liu, J.: Validating contact times extracted from mobility traces. In: Puliafito, A., Bruneo, D., Distefano, S., Longo, F. (eds.) Ad-hoc, Mobile, and Wireless Networks, pp. 239–252. Springer International Publishing, Cham (2017)

    Chapter  Google Scholar 

  21. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks, pp. 252–259. ACM, New York (2005)

    Google Scholar 

  22. Stefa, J., Mei, A.: Swim: a simple model to generate small mobile worlds. In: Proceedings of IEEE INFOCOM Conference. IEEE, Piscataway (2009)

    Google Scholar 

  23. Udugama, A., Förster, A., Kuladinithi, K., Dede, J., Kuppusamy, V., Vatandas, Z.: My smartphone tattles: Considering popularity of messages in opportunistic data dissemination. MDPI Future Internet 2019, 11(2), 29 (2019)

    Google Scholar 

  24. Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Tech. Rep. Technical report number CS-200006, Duke University (2000). ftp://ftp.cs.duke.edu/dist/techreport/2000/2000-06.ps

  25. Zhang, R., Chandran, A.R., Timmons, N., Morrison, J.: OppSim: a simulation framework for opportunistic networks based on MiXiM. In: Proceedings of the IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2014, Athens. IEEE, Piscataway (2014)

    Google Scholar 

  26. Zhao, Z., Mosler, B., Braun, T.: Performance evaluation of opportunistic routing protocols: a framework-based approach using OMNeT++. In: Proceedings of the 7th Latin American Networking Conference, pp. 28–35. ACM, Medellin (2012)

    Google Scholar 

Download references

Acknowledgements

We would like to thank the students at the University of Bremen, who contributed over the years to create the OPS framework: Anas bin Muslim, Karima Khandaker, Mine Centinkaya, Kirishanth Chethuraja, and Jibin Pathapparambil John.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jens Dede .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Udugama, A., Förster, A., Dede, J., Kuppusamy, V. (2019). Simulating Opportunistic Networks with OMNeT++ . In: Virdis, A., Kirsche, M. (eds) Recent Advances in Network Simulation. EAI/Springer Innovations in Communication and Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-12842-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-12842-5_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-12841-8

  • Online ISBN: 978-3-030-12842-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics