{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:17:09Z","timestamp":1761621429837,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Opportunistic networks have recently seen increasing interest in the networking community. They can serve a range of application scenarios, most of them being destination-less, i.e., without a-priori knowledge of who is the final destination of a message. In this paper, we explore the usage of data popularity for improving the efficiency of data forwarding in opportunistic networks. Whether a message will become popular or not is not known before disseminating it to users. Thus, popularity needs to be estimated in a distributed manner considering a local context. We propose Keetchi, a data forwarding protocol based on Q-Learning to give more preference to popular data rather than less popular data. Our extensive simulation comparison between Keetchi and the well known Epidemic protocol shows that the network overhead of data forwarding can be significantly reduced while keeping the delivery rate the same.<\/jats:p>","DOI":"10.3390\/fi11020029","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T11:27:52Z","timestamp":1548761272000},"page":"29","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["My Smartphone tattles: Considering Popularity of Messages in Opportunistic Data Dissemination"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8159-5146","authenticated-orcid":false,"given":"Asanga","family":"Udugama","sequence":"first","affiliation":[{"name":"Sustainable Communications Networks Group, University of Bremen, 28359 Bremen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8422-265X","authenticated-orcid":false,"given":"Jens","family":"Dede","sequence":"additional","affiliation":[{"name":"Sustainable Communications Networks Group, University of Bremen, 28359 Bremen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5755-2672","authenticated-orcid":false,"given":"Anna","family":"F\u00f6rster","sequence":"additional","affiliation":[{"name":"Sustainable Communications Networks Group, University of Bremen, 28359 Bremen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8583-7648","authenticated-orcid":false,"given":"Vishnupriya","family":"Kuppusamy","sequence":"additional","affiliation":[{"name":"Sustainable Communications Networks Group, University of Bremen, 28359 Bremen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6083-4048","authenticated-orcid":false,"given":"Koojana","family":"Kuladinithi","sequence":"additional","affiliation":[{"name":"Institute of Communication Networks, Hamburg University of Technology, 21073 Hamburg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5998-6113","authenticated-orcid":false,"given":"Andreas","family":"Timm-Giel","sequence":"additional","affiliation":[{"name":"Institute of Communication Networks, Hamburg University of Technology, 21073 Hamburg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5047-1175","authenticated-orcid":false,"given":"Zeynep","family":"Vatandas","sequence":"additional","affiliation":[{"name":"Institute of Communication Networks, Hamburg University of Technology, 21073 Hamburg, Germany"}]}],"member":"1968","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/j.giq.2015.05.003","article-title":"Civic Open Data at a Crossroads: Dominant Models and Current Challenges","volume":"32","author":"Sieber","year":"2015","journal-title":"Gov. Inf. Q."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1109\/COMST.2017.2782182","article-title":"Simulating Opportunistic Networks: Survey and Future Directions","volume":"20","author":"Dede","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Vatandas, Z., Hamm, S.M., Kuladinithi, K., Killat, U., Timm-Giel, A., and F\u00f6rster, A. (2018, January 12\u201315). Modeling of Data Dissemination in OppNets. Proceedings of the 19th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, Chania, Greece.","DOI":"10.1109\/WoWMoM.2018.8449748"},{"key":"ref_4","unstructured":"Vahdat, A., and Becker, D. (2000). Epidemic Routing for Partially Connected Ad Hoc Networks, Duke University. Technical Report."},{"key":"ref_5","unstructured":"Kuppusamy, V., Thanthrige, U., Udugama, A., and F\u00f6rster, A. (2019). Survey of Opportunistic Networking Data Forwarding Protocols and Their Evaluation Methodologies. under review."},{"key":"ref_6","unstructured":"F\u00f6rster, A., Muslim, A.B., and Udugama, A. (2017, January 7\u20138). Reactive User Behavior and Mobility Models. Proceedings of the 4th OMNeT++ Community Summit, Bremen, Germany."},{"key":"ref_7","unstructured":"(2018, November 01). The Jodel Venture GmbH. Jodel\u2014The Hyperlocal App. Available online: https:\/\/www.jodel-app.com."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R., and Krishnan, R. (2007, January 11). Prioritized Epidemic Routing for Opportunistic Networks. Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking, MobiOpp \u201907, San Juan, PR, USA.","DOI":"10.1145\/1247694.1247707"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/TNET.2007.897962","article-title":"Efficient routing in intermittently connected mobile networks: The single-copy case","volume":"16","author":"Spyropoulos","year":"2008","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., and Raghavendra, C.S. (2005, January 26). 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_11","doi-asserted-by":"crossref","unstructured":"Haeupler, B. (2013, January 6\u20138). Simple, Fast and Deterministic Gossip and Rumor Spreading. Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201913, New Orleans, LA, USA.","DOI":"10.1137\/1.9781611973105.51"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Turletti, T., and Obraczka, K. (2007, January 18\u201321). Utility-based Message Replication for Intermittently Connected Heterogeneous Networks. Proceedings of the 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, Espoo, Finland.","DOI":"10.1109\/WOWMOM.2007.4351693"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Lieser, P., Alvarez, F., Gardner-Stephen, P., Hollick, M., and Boehnstedt, D. (2017, January 19\u201322). Architecture for Responsive Emergency Communications Networks. Proceedings of the 2017 IEEE Global Humanitarian Technology Conference (GHTC), San Jose, CA, USA.","DOI":"10.1109\/GHTC.2017.8239239"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1109\/TWC.2016.2636139","article-title":"Context-Aware Proactive Content Caching With Service Differentiation in Wireless Networks","volume":"16","author":"Atan","year":"2017","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_15","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, PerCom Workshops\u2019 07, White Plains, NY, USA.","DOI":"10.1109\/PERCOMW.2007.108"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Huang, T.K., Lee, C.K., and Chen, L.J. (2010, January 20\u201323). Prophet+: An adaptive prophet-based routing protocol for opportunistic network. Proceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications (AINA), Perth, WA, Australia.","DOI":"10.1109\/AINA.2010.162"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Grasic, S., Davies, E., Lindgren, A., and Doria, A. (2011, January 23). The evolution of a DTN routing protocol-PRoPHETv2. Proceedings of the 6th ACM Workshop on Challenged Networks, Las Vegas, NV, USA.","DOI":"10.1145\/2030652.2030661"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Burgess, J., Gallagher, B., Jensen, D., and Levine, B.N. (2006, January 23\u201329). Maxprop: Routing for vehicle-based disruption-tolerant networks. Proceedings of the INFOCOM 2006, 25th IEEE International Conference on Computer Communications, Barcelona, Spain.","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"ref_19","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_20","doi-asserted-by":"crossref","unstructured":"Boldrini, C., Conti, M., Jacopini, J., and Passarella, A. (2007, January 18\u201321). Hibop: A history based routing protocol for opportunistic networks. Proceedings of the IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2007, Espoo, Finland.","DOI":"10.1109\/WOWMOM.2007.4351716"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Okamoto, K., and Takami, K. (2016). Routing Based on Information about the Routes of Fixed-Route Traveling Nodes and on Destination Areas Aimed at Reducing the Load on the DTN. Future Internet, 8.","DOI":"10.3390\/fi8020015"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Liu, K., Chen, Z., Wu, J., Xiao, Y., and Zhang, H. (2018). Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks. Future Internet, 10.","DOI":"10.3390\/fi10080074"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"F\u00f6rster, A., Udugama, A., G\u00f6rg, C., Kuladinithi, K., Timm-Giel, A., and Cama-Pinto, A. (2015, January 16\u201318). A Novel Data Dissemination Model for Organic Data Flows. Proceedings of the 7th EAI International Conference on Mobile Networks and Management (MONAMI), Santander, Spain.","DOI":"10.1007\/978-3-319-26925-2_18"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Sang, L., Kuppusamy, V., F\u00f6rster, A., Udugama, A., and Liu, J. (2017, January 20\u201322). Validating Contact Times Extracted from Mobility Traces. Proceedings of the 16th International Conference on Ad Hoc Networks and Wireless, ADHOC-NOW, Messina, Italy.","DOI":"10.1007\/978-3-319-67910-5_20"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"589","DOI":"10.3390\/jsan2030589","article-title":"Performance Analysis and Comparison of Bluetooth Low Energy with IEEE 802.15.4 and SimpliciTI","volume":"2","author":"Mikhaylov","year":"2013","journal-title":"J. Sens. Actuator Netw."},{"key":"ref_26","unstructured":"Udugama, A., F\u00f6rster, A., Dede, J., Kuppusamy, V., and Muslim, A.B. (2017, January 7\u20138). Opportunistic Networking Protocol Simulator for OMNeT++. Proceedings of the 4th OMNeT++ Community Summit, Bremen, Germany."},{"key":"ref_27","unstructured":"Udugama, A., Khalilov, B., Bin Muslim, A., and F\u00f6rster, A. (2016, January 15\u201316). Implementation of the SWIM Mobility Model in OMNeT++. Proceedings of the OMNeT++ Summit, Brno, Czech Republic."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"823","DOI":"10.3390\/fi9040082","article-title":"A Combinational Buffer Management Scheme in Mobile Opportunistic Network","volume":"9","author":"Yuan","year":"2017","journal-title":"Future Internet"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/2\/29\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:29:28Z","timestamp":1760185768000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/2\/29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":28,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,2]]}},"alternative-id":["fi11020029"],"URL":"https:\/\/doi.org\/10.3390\/fi11020029","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2019,1,29]]}}}