{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:48:25Z","timestamp":1760237305570,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T00:00:00Z","timestamp":1586304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61462079, 61562086 ,61562078 , 61862060"],"award-info":[{"award-number":["61462079, 61562086 ,61562078 , 61862060"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Support Project of Ministry of National Science and Technology of China","award":["2015BAH02F01"],"award-info":[{"award-number":["2015BAH02F01"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>With the flourishing of big data and the 5G era, the amount of data to be transmitted in the communication process is increasing, and end-to-end communication in traditional social networks has been unable to meet the current communication needs. Therefore, in order to improve the success rate of data forwarding, social networks propose that the sender of the message should reasonably choose the next hop node. However, existing routing and forwarding algorithms do not take into account nodes that are live in different scenarios, and the applicable next hop node metrics are also different. These algorithms only consider the forwarding preferences of the nodes during working hours and do not consider the forwarding preferences of the nodes during non-working hours. We propose a routing algorithm based on fuzzy decision theory, which aims at a more accurate decision on selecting the next hop. A routing and forwarding algorithm based on fuzzy decision is proposed in this paper. This algorithm symmetrical divides scenes in opportunistic social networks into working time and non-working time according to real human activity. In addition, metrics are designed symmetrically for these two scenarios. Simulation results demonstrate that, in the best case, the proposed scheme presents an average delivery ratio of 0.95 and reduces the average end-to-end delay and average overhead compared with the epidemic routing algorithm, the EIMSTalgorithm, the ICMT algorithm, and the FCNSalgorithm.<\/jats:p>","DOI":"10.3390\/sym12040589","type":"journal-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T14:42:03Z","timestamp":1586443323000},"page":"589","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Comprehensive Multi-Scenario Routing Algorithm Based on Fuzzy Control Theory in Opportunistic Social Network"],"prefix":"10.3390","volume":"12","author":[{"given":"Yao","family":"Yu","sequence":"first","affiliation":[{"name":"School of Software, Xinjiang University, Urumqi 830000, China"}]},{"given":"Jiong","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Software, Xinjiang University, Urumqi 830000, China"}]},{"given":"Zhigang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410075, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9013-0818","authenticated-orcid":false,"given":"Jia","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410075, China"}]},{"given":"Yeqing","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410075, China"}]}],"member":"1968","published-online":{"date-parts":[[2020,4,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"113511","DOI":"10.1109\/ACCESS.2019.2934792","article-title":"Mode Selection for 5G Heterogeneous and Opportunistic Networks","volume":"7","author":"Gozalvez","year":"2019","journal-title":"IEEE Access"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Yan, Y., Chen, Z., Wu, J., and Wang, L. (2018). An effective data transmission algorithm based on social relationships in opportunistic mobile social networks. Algorithms, 11.","DOI":"10.3390\/a11080125"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"3357","DOI":"10.1007\/s11277-017-4001-1","article-title":"Human Activity Optimal Cooperation Objects Selection Routing Scheme in Opportunistic Networks Communication","volume":"95","author":"Wu","year":"2017","journal-title":"Wirel. Pers. Commun."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.jpdc.2019.09.005","article-title":"Preparing opportunistic networks for smart cities: Collecting sensed data with minimal knowledge","volume":"135","author":"Amah","year":"2020","journal-title":"J. Parallel Distr. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"102457","DOI":"10.1016\/j.jnca.2019.102457","article-title":"Social-aware cooperative caching mechanism in mobile social networks","volume":"149","author":"Wu","year":"2020","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.compbiomed.2019.04.021","article-title":"Hospital evaluation mechanism based on mobile health for IoT system in social networks","volume":"109","author":"Wu","year":"2019","journal-title":"Comput. Biol. Med."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s12083-018-0649-x","article-title":"Weight distribution and community reconstitution based on communities communications in social opportunistic networks","volume":"12","author":"Wu","year":"2019","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/TII.2014.2374071","article-title":"Opportunistic Routing Algorithm for Relay Node Selection in Wireless Sensor Networks","volume":"11","author":"Luo","year":"2015","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"3103","DOI":"10.1007\/s11276-018-1705-4","article-title":"Opportunistic routing with data fusion for multi-source wireless sensor networks","volume":"25","author":"Li","year":"2019","journal-title":"Wirel. Netw."},{"key":"ref_10","first-page":"777","article-title":"Cooperative Store-Carry-Forward Scheme for Intermittently Connected Vehicular Networks","volume":"66","author":"Wang","year":"2017","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1155\/2020\/3576542","article-title":"Advanced Data Delivery Strategy Base on Multi-Perceived Community with IoT in Social Complex Networks","volume":"2020","author":"Luo","year":"2020","journal-title":"Complexity"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Wu, J., Chen, Z., and Zhao, M. (2020). Community recombination and duplication node traverse algorithm in opportunistic social networks. Peer-to-Peer Netw. Appl., 1\u20138.","DOI":"10.1007\/s12083-019-00833-0"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Socievole, A., Caputo, A., De Rango, F., and Fazio, P. (2019). Routing in Mobile Opportunistic Social Networks with Selfish Nodes. Wirel. Commun. Mob. Comput.","DOI":"10.1155\/2019\/6359806"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"59002","DOI":"10.1109\/ACCESS.2019.2915359","article-title":"Interest characteristic probability predicted method in social opportunistic networks","volume":"7","author":"Wu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Lenando, H., and Alrfaay, M. (2018). EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network. Mob. Inf. Syst.","DOI":"10.1155\/2018\/6462826"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"10372","DOI":"10.1109\/TVT.2017.2740218","article-title":"Predicting Temporal Social Contact Patterns for Data Forwarding in Opportunistic Mobile Networks","volume":"66","author":"Zhou","year":"2017","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"e3297","DOI":"10.1002\/ett.3297","article-title":"Social identity\u2013aware opportunistic routing in mobile social networks","volume":"29","author":"Wang","year":"2018","journal-title":"Trans. Emerg. Telecommun. Technol."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2825","DOI":"10.1109\/TMC.2016.2517649","article-title":"PIS: A Multi-dimensional Routing Protocol for Socially-aware Networking","volume":"15","author":"Xia","year":"2016","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_19","first-page":"4173","article-title":"Fundamental analysis on data dissemination in mobile opportunistic networks with L\u00e9vy mobility","volume":"66","author":"Wang","year":"2016","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1109\/TFUZZ.2017.2688349","article-title":"A Fast and Accurate Rule-Base Generation Method for Mamdani Fuzzy Systems","volume":"26","author":"Dutu","year":"2018","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_21","first-page":"3190631","article-title":"An Improved Model of Variable Fuzzy Sets with Normal Membership Function for Crane Safety Evaluation","volume":"2017","author":"Li","year":"2017","journal-title":"Math. Probl. Eng."},{"key":"ref_22","first-page":"1","article-title":"Selective epidemic broadcast algorithm to suppress broadcast storm in vehicular ad hoc networks","volume":"19","author":"Chitra","year":"2017","journal-title":"Egy. Inf. J."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Sisodiya, S., Sharma, P., and Tiwari, S.K. (2017, January 10\u201311). A new modifified spray and wait routing algorithm for heterogeneous delay tolerant network. Proceedings of the 2017 International Conference on International Conference on I-Smac, Coimbatore, India.","DOI":"10.1109\/I-SMAC.2017.8058298"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2037","DOI":"10.1109\/LCOMM.2015.2474856","article-title":"Non-Orthogonal Multiple Access in Coordinated Direct and Relay Transmission","volume":"19","author":"Kim","year":"2015","journal-title":"IEEE Commun. Lett."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1109\/JSYST.2016.2630923","article-title":"A machine learning-based protocol for effificient routing in opportunistic networks","volume":"12","author":"Sharma","year":"2018","journal-title":"IEEE Syst. J."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2977","DOI":"10.1007\/s11276-018-1691-6","article-title":"Information cache management and data transmission algorithm in opportunistic social networks","volume":"25","author":"Wu","year":"2019","journal-title":"Wirel. Netw."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"22144","DOI":"10.1109\/ACCESS.2019.2898895","article-title":"Effective data transmission strategy based on node socialization in opportunistic social networks","volume":"7","author":"Yan","year":"2019","journal-title":"IEEE Access"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Liu, K., Chen, Z., Wu, J., and Wang, L. (2018). FCNS: A fuzzy routing-forwarding algorithm exploiting comprehensive node similarity in opportunistic social networks. Symmetry, 10.","DOI":"10.3390\/sym10080338"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1750115","DOI":"10.1142\/S0129183117501157","article-title":"Social-aware data dissemination in opportunistic mobile social networks","volume":"28","author":"Yang","year":"2017","journal-title":"Int. J. Modern Phys. C"},{"key":"ref_30","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_31","doi-asserted-by":"crossref","unstructured":"Wu, J., Chen, Z., and Zhao, M. (2019). An efficient data packet iteration and transmission algorithm in opportunistic social networks. J. Ambient Intell. Humanized Comput.","DOI":"10.1007\/s12652-019-01480-2"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Zhang, L., Shi, H., Hwang, K.-S., Shi, X., and Luo, S. (2019). An Adaptive Routing-Forwarding Control Scheme Based on an Intelligent Fuzzy Decision-Making System for Opportunistic Social Networks. Symmetry, 11.","DOI":"10.3390\/sym11091095"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2629","DOI":"10.1007\/s11227-018-2675-0","article-title":"SECM: Status Estimation and Cache Management algorithm in opportunistic networks","volume":"75","author":"Wu","year":"2019","journal-title":"J. Supercomput."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/4\/589\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:16:25Z","timestamp":1760174185000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/4\/589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,8]]},"references-count":33,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,4]]}},"alternative-id":["sym12040589"],"URL":"https:\/\/doi.org\/10.3390\/sym12040589","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2020,4,8]]}}}