{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T10:19:35Z","timestamp":1784024375825,"version":"3.55.0"},"reference-count":27,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T00:00:00Z","timestamp":1620691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"EU AAL","award":["vINCI"],"award-info":[{"award-number":["vINCI"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Constant Internet connectivity has become a necessity in our lives. Hence, music festival organizers allocate part of their budget for temporary Wi-Fi equipment in order to sustain the high network traffic generated in such a small geographical area, but this naturally leads to high costs that need to be decreased. Thus, in this paper, we propose a solution that can help offload some of that traffic to an opportunistic network created with the attendees\u2019 smartphones, therefore minimizing the costs of the temporary network infrastructure. Using a music festival-based mobility model that we propose and analyze, we introduce two routing algorithms which can enable end-to-end message delivery between participants. The key factors for high performance are social metrics and limiting the number of message copies at any given time. We show that the proposed solutions are able to offer high delivery rates and low delivery delays for various scenarios at a music festival.<\/jats:p>","DOI":"10.3390\/s21103315","type":"journal-article","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T11:30:16Z","timestamp":1620732616000},"page":"3315","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Opportunistic Network Algorithms for Internet Traffic Offloading in Music Festival Scenarios"],"prefix":"10.3390","volume":"21","author":[{"given":"Aida-\u0218tefania","family":"Manole","sequence":"first","affiliation":[{"name":"Faculty of Automatic Control and Computers, University Politehnica of Bucharest, 060042 Bucharest, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4114-1139","authenticated-orcid":false,"given":"Radu-Ioan","family":"Ciobanu","sequence":"additional","affiliation":[{"name":"Faculty of Automatic Control and Computers, University Politehnica of Bucharest, 060042 Bucharest, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4638-7725","authenticated-orcid":false,"given":"Ciprian","family":"Dobre","sequence":"additional","affiliation":[{"name":"Faculty of Automatic Control and Computers, University Politehnica of Bucharest, 060042 Bucharest, Romania"},{"name":"National Institute for Research and Development in Informatics, 060042 Bucharest, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3881-4574","authenticated-orcid":false,"given":"Raluca","family":"Purnichescu-Purtan","sequence":"additional","affiliation":[{"name":"Department of Mathematical Methods and Models, University Politehnica of Bucharest, 060042 Bucharest, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L.S., and Rubenstein, D. (2002, January 5\u20139). Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet. Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS X), San Jose, CA, USA.","DOI":"10.1145\/605397.605408"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Franke, T., Negele, S., Kampis, G., and Lukowicz, P. (December, January 30). Leveraging human mobility in smartphone based Ad-Hoc information distribution in crowd management scenarios. Proceedings of the 2015 2nd International Conference on Information and Communication Technologies for Disaster Management (ICT-DM), Rennes, France.","DOI":"10.1109\/ICT-DM.2015.7402053"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Herrera-Tapia, J., Hern\u00e1ndez-Orallo, E., Tom\u00e1s, A., Manzoni, P., Tavares Calafate, C., and Cano, J.C. (2016). Friendly-sharing: Improving the performance of city sensoring through contact-based messaging applications. Sensors, 16.","DOI":"10.3390\/s16091523"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., and Raghavendra, C.S. (2005, January 22\u201326). Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN \u201905), Philadelphia, PA, USA.","DOI":"10.1145\/1080139.1080143"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.procs.2016.03.076","article-title":"A survey on opportunistic routing protocols for wireless sensor networks","volume":"79","author":"Jadhav","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1504\/IJITST.2017.091514","article-title":"Incorporating privacy and security in military application based on opportunistic sensor network","volume":"7","author":"Arafath","year":"2017","journal-title":"Int. J. Internet Technol. Secur. Trans."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/MC.2004.1260729","article-title":"Daknet: Rethinking connectivity in developing nations","volume":"37","author":"Pentland","year":"2004","journal-title":"Computer"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Zyba, G., Voelker, G.M., Ioannidis, S., and Diot, C. (2011, January 10\u201315). Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd. Proceedings of the 2011 Proceedings IEEE INFOCOM, Shanghai, China.","DOI":"10.1109\/INFCOM.2011.5934896"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.procs.2011.07.008","article-title":"Opportunistic communications for emergency support systems","volume":"5","author":"Gorbil","year":"2011","journal-title":"Procedia Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Barzan, A., Bonn\u00e9, B., Quax, P., Lamotte, W., Versichele, M., and Van de Weghe, N. (2013, January 4\u20137). A comparative simulation of opportunistic routing protocols using realistic mobility data obtained from mass events. Proceedings of the 2013 IEEE 14th International Symposium on \u201ca World of Wireless, Mobile and Multimedia Networks\u201d (WoWMoM), Madrid, Spain.","DOI":"10.1109\/WoWMoM.2013.6583438"},{"key":"ref_11","unstructured":"Vahdat, A., and Becker, D. (2021, April 01). Epidemic Routing for Partially-Connected Ad Hoc Networks, 2009. Available online: https:\/\/bit.ly\/3y2dqAX."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/961268.961272","article-title":"Probabilistic Routing in Intermittently Connected Networks","volume":"7","author":"Lindgren","year":"2003","journal-title":"SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"ref_13","first-page":"43","article-title":"We know what you did last sonar: Inferring preference in music from mobility data","volume":"998","author":"Cucchietti","year":"2019","journal-title":"Intelligent Computing\u2014Proceedings of the Computing Conference"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Ciobanu, R.I., Marin, R.C., and Dobre, C. (2018). Mobemu: A framework to support decentralized ad-hoc networking. Modeling and Simulation in HPC and Cloud Systems, Springer.","DOI":"10.1007\/978-3-319-73767-6_6"},{"key":"ref_15","unstructured":"Still, G.K. (2021, April 01). Static Crowd Density, 2019. Available online: https:\/\/www.gkstill.com\/Support\/crowd-density\/CrowdDensity-1.html."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"32514","DOI":"10.1109\/ACCESS.2018.2846201","article-title":"Evaluating and enhancing information dissemination in urban areas of interest using opportunistic networks","volume":"6","author":"Manzoni","year":"2018","journal-title":"IEEE Access"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Musolesi, M., and Mascolo, C. (2006, January 26). A Community Based Mobility Model for Ad Hoc Network Research. Proceedings of the 2nd International Workshop on Multi-Hop Ad Hoc Networks: From Theory to Reality (REALMAN \u201906), Florence, Italy.","DOI":"10.1145\/1132983.1132990"},{"key":"ref_18","unstructured":"Boldrini, C., Conti, M., and Passarella, A. (October, January 30). Users mobility models for opportunistic networks: The role of physical locations. Proceedings of the Wireless Rural and Emergency Communications Conference (WRECOM 2007), Rome, Italy."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Larsen, J., Sapiezynski, P., Stopczynski, A., M\u00f8rup, M., and Theodorsen, R. (2013, January 21\u201326). Crowds, Bluetooth and Rock\u2019n\u2019Roll: Understanding Music Festival Participant Behavior. Proceedings of the Sunbelt 2013, 33rd Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA 2013), Hamburg, Germany.","DOI":"10.1145\/2509352.2509399"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.physa.2003.06.002","article-title":"Detection of topological patterns in complex networks: Correlation profile of the internet","volume":"333","author":"Maslov","year":"2004","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1576","DOI":"10.1109\/TMC.2010.246","article-title":"BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks","volume":"10","author":"Hui","year":"2011","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Hui, P., Yoneki, E., Chan, S.Y., and Crowcroft, J. (2007, January 27). Distributed Community Detection in Delay Tolerant Networks. Proceedings of the 2nd ACM\/IEEE International Workshop on Mobility in the Evolving Internet Architecture (MobiArch \u201907), Kyoto, Japan.","DOI":"10.1145\/1366919.1366929"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.comcom.2018.03.013","article-title":"Practical opportunistic content dissemination performance in dense network segments","volume":"123","author":"Roy","year":"2018","journal-title":"Comput. Commun."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/MCOM.2017.1700354","article-title":"Improving opportunistic networks by leveraging device-to-device communication","volume":"55","author":"Marin","year":"2017","journal-title":"IEEE Commun. Mag."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., and Raghavendra, C.S. (2007, January 19\u201323). Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility. Proceedings of the Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW\u201907), White Plains, NY, USA.","DOI":"10.1109\/PERCOMW.2007.108"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/MWC.2013.6549288","article-title":"Device to device communications with WiFi Direct: Overview and experimentation","volume":"20","year":"2013","journal-title":"IEEE Wirel. Commun."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.comnet.2015.02.016","article-title":"ML-SOR: Message routing using multi-layer social networks in opportunistic communications","volume":"81","author":"Socievole","year":"2015","journal-title":"Comput. Netw."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/21\/10\/3315\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:59:06Z","timestamp":1760162346000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/21\/10\/3315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,11]]},"references-count":27,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2021,5]]}},"alternative-id":["s21103315"],"URL":"https:\/\/doi.org\/10.3390\/s21103315","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,11]]}}}