{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:34:21Z","timestamp":1773272061432,"version":"3.50.1"},"reference-count":50,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:00:00Z","timestamp":1558569600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Opportunistic networks are becoming a solution to provide communication support in areas with overloaded cellular networks, and in scenarios where a fixed infrastructure is not available, as in remote and developing regions. A critical issue, which still requires a satisfactory solution, is the design of an efficient data delivery solution trading off delivery efficiency, delay, and cost. To tackle this problem, most researchers have used either the network state or node mobility as a forwarding criterion. Solutions based on social behaviour have recently been considered as a promising alternative. Following the philosophy from this new category of protocols, in this work, we present our \u201cFriendShip and Acquaintanceship Forwarding\u201d (FSF) protocol, a routing protocol that makes its routing decisions considering the social ties between the nodes and both the selfishness and the device resources levels of the candidate node for message relaying. When a contact opportunity arises, FSF first classifies the social ties between the message destination and the candidate to relay. Then, by using logistic functions, FSF assesses the relay node selfishness to consider those cases in which the relay node is socially selfish. To consider those cases in which the relay node does not accept receipt of the message because its device has resource constraints at that moment, FSF looks at the resource levels of the relay node. By using the ONE simulator to carry out trace-driven simulation experiments, we find that, when accounting for selfishness on routing decisions, our FSF algorithm outperforms previously proposed schemes, by increasing the delivery ratio up to 20%, with the additional advantage of introducing a lower number of forwarding events. We also find that the chosen buffer management algorithm can become a critical element to improve network performance in scenarios with selfish nodes.<\/jats:p>","DOI":"10.3390\/s19102374","type":"journal-article","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T02:22:00Z","timestamp":1558664520000},"page":"2374","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["FSF: Applying Machine Learning Techniques to Data Forwarding in Socially Selfish Opportunistic Networks"],"prefix":"10.3390","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1557-765X","authenticated-orcid":false,"given":"Camilo","family":"Souza","sequence":"first","affiliation":[{"name":"Institute of Computing, Federal University of Amazonas, Manaus 69080-900, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edjair","family":"Mota","sequence":"additional","affiliation":[{"name":"Institute of Computing, Federal University of Amazonas, Manaus 69080-900, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2331-6553","authenticated-orcid":false,"given":"Diogo","family":"Soares","sequence":"additional","affiliation":[{"name":"Institute of Computing, Federal University of Amazonas, Manaus 69080-900, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3753-0403","authenticated-orcid":false,"given":"Pietro","family":"Manzoni","sequence":"additional","affiliation":[{"name":"Departamento de Inform\u00e1tica de Sistemas y Computadores. Universitat Polit\u00e8cnica de Val\u00e8ncia, 46022 Valencia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0038-0539","authenticated-orcid":false,"given":"Juan-Carlos","family":"Cano","sequence":"additional","affiliation":[{"name":"Departamento de Inform\u00e1tica de Sistemas y Computadores. Universitat Polit\u00e8cnica de Val\u00e8ncia, 46022 Valencia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5729-3041","authenticated-orcid":false,"given":"Carlos T.","family":"Calafate","sequence":"additional","affiliation":[{"name":"Departamento de Inform\u00e1tica de Sistemas y Computadores. Universitat Polit\u00e8cnica de Val\u00e8ncia, 46022 Valencia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3284-561X","authenticated-orcid":false,"given":"Enrique","family":"Hern\u00e1ndez-Orallo","sequence":"additional","affiliation":[{"name":"Departamento de Inform\u00e1tica de Sistemas y Computadores. Universitat Polit\u00e8cnica de Val\u00e8ncia, 46022 Valencia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/MCOM.2017.1500527CM","article-title":"A Decade of Research in Opportunistic Networks: Challenges, Relevance, and Future Directions","volume":"55","author":"Trifunovic","year":"2017","journal-title":"IEEE Commun. Mag."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Li, Y., Zhao, L., Liu, Z., and Liu, Q. (2009, January 21\u201324). N-Drop: Congestion control strategy under epidemic routing in DTN. Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, Leipzig, Germany.","DOI":"10.1145\/1582379.1582479"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Lu, X., Lio, P., and Hui, P. (2016). Distance-based opportunistic mobile data offloading. Sensors, 16.","DOI":"10.3390\/s16060878"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Zeng, F., Zhao, N., and Li, W. (2017). Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks. Sensors, 17.","DOI":"10.3390\/s17051109"},{"key":"ref_5","first-page":"305","article-title":"Uma an\u00e1lise da probabilidade de entrega de mensagens em redes tolerantes a atrasos e desconexoes","volume":"293","author":"Moreira","year":"2007","journal-title":"SBRC Simp\u00f3sio Brasileiro de Redes de Computadores e Sistemas Distribu\u00eddos"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1109\/SURV.2011.041911.00093","article-title":"Disruption-tolerant networking: A comprehensive survey on recent developments and persisting challenges","volume":"14","author":"Khabbaz","year":"2012","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.ijinfomgt.2012.11.001","article-title":"An investigation on the unwillingness of nodes to participate in mobile delay tolerant network routing","volume":"33","author":"Miao","year":"2013","journal-title":"Int. J. Inf. Manag."},{"key":"ref_8","unstructured":"Akestoridis, D.G. (2009, May 29). CRAWDAD Dataset Uoi\/Haggle (v. 2016-08-28): Derived from Cambridge\/Haggle (v. 2009-05-29). Available online: https:\/\/crawdad.org\/uoi\/haggle\/20160828."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"15274","DOI":"10.1073\/pnas.0900282106","article-title":"Inferring social network structure using mobile phone data","volume":"106","author":"Pentland","year":"2009","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/MCOM.2015.7295476","article-title":"NCCU Trace: Social-network-aware mobility trace","volume":"53","author":"Tsai","year":"2015","journal-title":"IEEE Commun. Mag."},{"key":"ref_11","first-page":"1","article-title":"Predicting location-sharing privacy preferences in social network applications","volume":"12","author":"Bigwood","year":"2012","journal-title":"Proc. Aware Cast"},{"key":"ref_12","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_13","doi-asserted-by":"crossref","unstructured":"Bulut, E., and Szymanski, B.K. (2010, January 6\u201310). Friendship based routing in delay tolerant mobile social networks. Proceedings of the 2010 IEEE Global Telecommunications Conference (GLOBECOM 2010), Miami, FL, USA.","DOI":"10.1109\/GLOCOM.2010.5683082"},{"key":"ref_14","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":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1109\/SURV.2012.042512.00053","article-title":"Routing in delay\/disruption tolerant networks: A taxonomy, survey and challenges","volume":"15","author":"Cao","year":"2013","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1109\/SURV.2012.032612.00004","article-title":"A survey of social-based routing in delay tolerant networks: Positive and negative social effects","volume":"15","author":"Zhu","year":"2013","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S1570-8705(03)00003-9","article-title":"Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks","volume":"1","author":"Shah","year":"2003","journal-title":"Ad Hoc Netw."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Zhao, W., Ammar, M., and Zegura, E. (2004, January 24\u201326). A message ferrying approach for data delivery in sparse mobile ad hoc networks. Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Tokyo, Japan.","DOI":"10.1145\/989459.989483"},{"key":"ref_19","unstructured":"Zhao, W., Ammar, M., and Zegura, E. (2005, January 13\u201317). Controlling the mobility of multiple data transport ferries in a delay-tolerant network. Proceedings of the IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Miami, FL, USA."},{"key":"ref_20","unstructured":"Zhao, W., and Ammar, M.H. (2003, January 30). Message ferrying: Proactive routing in highly-partitioned wireless ad hoc networks. Proceedings of the Ninth IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), San Juan, PR, USA."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.adhoc.2007.05.002","article-title":"MORA routing and capacity building in disruption-tolerant networks","volume":"6","author":"Burns","year":"2008","journal-title":"Ad Hoc Netw."},{"key":"ref_22","unstructured":"Vahdat, A., and Becker, D. (2000). Epidemic Routing for Partially Connected Ad Hoc Networks, Duke University. Technical Report, Technical Report CS-200006."},{"key":"ref_23","first-page":"104","article-title":"Optimal Forwarding in Opportunistic Delay Tolerant Networks with Meeting Rate Estimations","volume":"1","author":"Shaghaghian","year":"2015","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"6547","DOI":"10.1109\/TVT.2015.2476703","article-title":"A Novel Routing Scheme for Resource-Constraint Opportunistic Networks: A Cooperative Multiplayer Bargaining Game Approach","volume":"65","author":"Li","year":"2016","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_25","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, Philadelphia, PA, USA.","DOI":"10.1145\/1080139.1080143"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/605432.605408","article-title":"Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet","volume":"37","author":"Juang","year":"2002","journal-title":"ACM Sigplan Not."},{"key":"ref_27","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 25TH IEEE International Conference on Computer Communications, Barcelona, Spain.","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"ref_28","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. ToN"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Liu, C., and Wu, J. (2009, January 18\u201321). An optimal probabilistic forwarding protocolin delay tolerant networks. Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, New Orleans, LA, USA.","DOI":"10.1145\/1530748.1530763"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Nguyen, H.A., Giordano, S., and Puiatti, A. (2007, January 18\u201321). Probabilistic routing protocol for intermittently connected mobile ad hoc network (propicman). Proceedings of the 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, Espoo, Finland.","DOI":"10.1109\/WOWMOM.2007.4351696"},{"key":"ref_31","unstructured":"Oliveira, E.C., and de Albuquerque, C.V. (2009, January 8\u201312). NECTAR: A DTN routing protocol based on neighborhood contact history. Proceedings of the 2009 ACM symposium on Applied Computing, Honolulu, HI, USA."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhang, L., Wang, X., Lu, J., Ren, M., Duan, Z., and Cai, Z. (2014). A novel contact prediction-based routing scheme for DTNs. Trans. Emerg. Telecommun. Technol.","DOI":"10.1002\/ett.2889"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1093\/bjps\/axi143","article-title":"Altruism, group selection and correlated interaction","volume":"56","author":"Okasha","year":"2005","journal-title":"Br. J. Philos. Sci."},{"key":"ref_34","unstructured":"Qin, Y., Li, L., Zhang, X., and Zhong, X. (2015). NFCU: A New Friendship-based Routing with Buffer Management in Opportunistic Networks. arXiv."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Souza, C., Mota, E., Galvao, L., Manzoni, P., Cano, J.C., and Calafate, C.T. (2016, January 27\u201330). Fsf: Friendship and selfishness forwarding for delay tolerant networks. Proceedings of the 2016 IEEE Symposium on Computers and Communication (ISCC), Messina, Italy.","DOI":"10.1109\/ISCC.2016.7543899"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Li, Q., Zhu, S., and Cao, G. (2010, January 14\u201319). Routing in socially selfish delay tolerant networks. Proceedings of the 2010 Proceedings IEEE INFOCOM, San Diego, CA, USA.","DOI":"10.1109\/INFCOM.2010.5462138"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1109\/TMC.2014.2343627","article-title":"CoCoWa: A collaborative contact-based watchdog for detecting selfish nodes","volume":"14","author":"Olmos","year":"2015","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Li, F., and Wu, J. (2009, January 22\u201326). LocalCom: A community-based epidemic forwarding scheme in disruption-tolerant networks. Proceedings of the SECON\u201909. 6th Annual IEEE Communications Society Conference onSensor, Mesh and Ad Hoc Communications and Networks, Rome, Italy.","DOI":"10.1109\/SAHCN.2009.5168942"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Park, M., Min, S., Thus, S., Oh, D., Kim, B., and Lee, J. (2010). Mobility pattern based routing algorithm for delay\/disruption tolerant networks. Smart Spaces and Next Generation Wired\/Wireless Networking, Springer.","DOI":"10.1007\/978-3-642-14891-0_25"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., and Diot, C. (2005, January 26). Pocket switched networks and human mobility in conference environments. Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, Philadelphia, PA, USA.","DOI":"10.1145\/1080139.1080142"},{"key":"ref_41","first-page":"41","article-title":"An empirical study of the naive Bayes classifier","volume":"Volume 3","author":"Rish","year":"2001","journal-title":"IJCAI 2001 Workshop on Empirical Methods in Artificial Intelligence"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Souza, C., Mota, E., Manzoni, P., Cano, J.C., and Calafate, C.T. (2016, January 22\u201326). Improving delivery delay in social-based message forwarding in Delay Tolerant Networks. Proceedings of the 2016 workshop on Fostering Latin-American Research in Data Communication Networks, Florianopolis, Brazil.","DOI":"10.1145\/2940116.2940125"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Marti, S., Giuli, T.J., Lai, K., and Baker, M. (2000, January 6\u201311). Mitigating routing misbehavior in mobile ad hoc networks. Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, Boston, MA, USA.","DOI":"10.1145\/345910.345955"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Li, W., and Joshi, A. (2009, January 18\u201320). Outlier detection in ad hoc networks using dempster-shafer theory. Proceedings of the Tenth International Conference on Mobile Data Management: Systems, Services and Middleware, MDM\u201909, Taipei, Taiwan.","DOI":"10.1109\/MDM.2009.22"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Soares, D., Mota, E., Souza, C., Manzoni, P., Cano, J.C., and Calafate, C. (2014, January 12\u201314). A statistical learning reputation system for opportunistic networks. Proceedings of the 2014 IFIP Wireless Days (WD), Rio de Janeiro, Brazil.","DOI":"10.1109\/WD.2014.7020822"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen, A., Ott, J., and K\u00e4rkk\u00e4inen, T. (2009, January 2\u20136). The ONE Simulator for DTN Protocol Evaluation. Proceedings of the 2nd International Conference on Simulation Tools and Techniques, SIMUTools \u201909, Rome, Italy.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"ref_47","unstructured":"Witten, I.H., Frank, E., Hall, M.A., and Pal, C.J. (2016). Data Mining: Practical Machine Learning Tools and Techniques, Morgan Kaufmann."},{"key":"ref_48","unstructured":"Silva, D.R., Costa, A., and Macedo, J. (2012, January 10\u201314). Energy impact analysis on DTN routing protocols. Proceedings of the ExtremeCom 2012, Zurich, Switzerland."},{"key":"ref_49","first-page":"5149","article-title":"Buffer Management Policies in Opportunistic Networks","volume":"8","author":"Tang","year":"2012","journal-title":"J. Comput. Inf. Syst."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Souza, C., Mota, E., Manzoni, P., Cano, J.C., Calafate, C.T., Hernandez-Orallo, E., and Tapia, J.H. (2018, January 3\u20135). Friendly-drop: A social-based buffer management algorithm for opportunistic networks. Proceedings of the Wireless Days (WD), Dubai, UAE.","DOI":"10.1109\/WD.2018.8361714"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/10\/2374\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:54:33Z","timestamp":1760187273000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/10\/2374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,23]]},"references-count":50,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2019,5]]}},"alternative-id":["s19102374"],"URL":"https:\/\/doi.org\/10.3390\/s19102374","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,23]]}}}