FSF: Applying machine learning techniques to data forwarding in socially selfish Opportunistic Networks

[EN] 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 ¿FriendShip and Acquaintanceship Forwarding¿ (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.This work was partially supported by the "Camilo Batista de Souza/Programa Doutorado-sanduiche no Exterior (PDSE)/Processo 88881.133931/2016-01" and by the Ministerio de Ciencia, Innovacion y Universidades, Programa Estatal de Investigacion, Desarrollo e Innovacion Orientada a los Retos de la Sociedad, Proyectos I+D+I 2018, Spain, under Grant RTI2018-096384-B-I00".Souza, C.; Mota, E.; Soares, D.; Manzoni, P.; Cano, J.; Tavares De Araujo Cesariny Calafate, CM.; Hernández-Orallo, E. (2019). FSF: Applying machine learning techniques to data forwarding in socially selfish Opportunistic Networks. Sensors. 19(10):1-26. https://doi.org/10.3390/s191023741261910Trifunovic, S., Kouyoumdjieva, S. T., Distl, B., Pajevic, L., Karlsson, G., & Plattner, B. (2017). A Decade of Research in Opportunistic Networks: Challenges, Relevance, and Future Directions. IEEE Communications Magazine, 55(1), 168-173. doi:10.1109/mcom.2017.1500527cmLu, X., Lio, P., & Hui, P. (2016). Distance-Based Opportunistic Mobile Data Offloading. Sensors, 16(6), 878. doi:10.3390/s16060878Zeng, F., Zhao, N., & Li, W. (2017). Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks. Sensors, 17(5), 1109. doi:10.3390/s17051109Khabbaz, M. J., Assi, C. M., & Fawaz, W. F. (2012). Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges. IEEE Communications Surveys & Tutorials, 14(2), 607-640. doi:10.1109/surv.2011.041911.00093Miao, J., Hasan, O., Mokhtar, S. B., Brunie, L., & Yim, K. (2013). An investigation on the unwillingness of nodes to participate in mobile delay tolerant network routing. International Journal of Information Management, 33(2), 252-262. doi:10.1016/j.ijinfomgt.2012.11.001CRAWDAD Dataset Uoi/Haggle (v. 2016-08-28): Derived from Cambridge/Haggle (v. 2009-05-29)https://crawdad.org/uoi/haggle/20160828Eagle, N., Pentland, A., & Lazer, D. (2009). Inferring friendship network structure by using mobile phone data. Proceedings of the National Academy of Sciences, 106(36), 15274-15278. doi:10.1073/pnas.0900282106Tsai, T.-C., & Chan, H.-H. (2015). NCCU Trace: social-network-aware mobility trace. IEEE Communications Magazine, 53(10), 144-149. doi:10.1109/mcom.2015.7295476Hui, P., Crowcroft, J., & Yoneki, E. (2011). BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks. IEEE Transactions on Mobile Computing, 10(11), 1576-1589. doi:10.1109/tmc.2010.246Lindgren, A., Doria, A., & Schelén, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19-20. doi:10.1145/961268.961272Cao, Y., & Sun, Z. (2013). Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges. IEEE Communications Surveys & Tutorials, 15(2), 654-677. doi:10.1109/surv.2012.042512.00053Zhu, Y., Xu, B., Shi, X., & Wang, Y. (2013). A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects. IEEE Communications Surveys & Tutorials, 15(1), 387-401. doi:10.1109/surv.2012.032612.00004Shah, R. C., Roy, S., Jain, S., & Brunette, W. (2003). Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 1(2-3), 215-233. doi:10.1016/s1570-8705(03)00003-9Burns, B., Brock, O., & Levine, B. N. (2008). MORA routing and capacity building in disruption-tolerant networks. Ad Hoc Networks, 6(4), 600-620. doi:10.1016/j.adhoc.2007.05.002Shaghaghian, S., & Coates, M. (2015). Optimal Forwarding in Opportunistic Delay Tolerant Networks With Meeting Rate Estimations. IEEE Transactions on Signal and Information Processing over Networks, 1(2), 104-116. doi:10.1109/tsipn.2015.2452811Li, L., Qin, Y., & Zhong, X. (2016). A Novel Routing Scheme for Resource-Constraint Opportunistic Networks: A Cooperative Multiplayer Bargaining Game Approach. IEEE Transactions on Vehicular Technology, 65(8), 6547-6561. doi:10.1109/tvt.2015.2476703Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002). Energy-efficient computing for wildlife tracking. ACM SIGPLAN Notices, 37(10), 96-107. doi:10.1145/605432.605408Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case. IEEE/ACM Transactions on Networking, 16(1), 63-76. doi:10.1109/tnet.2007.897962Zhang, L., Wang, X., Lu, J., Ren, M., Duan, Z., & Cai, Z. (2014). A novel contact prediction-based routing scheme for DTNs. Transactions on Emerging Telecommunications Technologies, 28(1), e2889. doi:10.1002/ett.2889Okasha, S. (2005). Altruism, Group Selection and Correlated Interaction. The British Journal for the Philosophy of Science, 56(4), 703-725. doi:10.1093/bjps/axi143Hernandez-Orallo, E., Olmos, M. D. S., Cano, J.-C., Calafate, C. T., & Manzoni, P. (2015). CoCoWa: A Collaborative Contact-Based Watchdog for Detecting Selfish Nodes. IEEE Transactions on Mobile Computing, 14(6), 1162-1175. doi:10.1109/tmc.2014.234362