{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:32:12Z","timestamp":1761611532764,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"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":"the 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 vigorous development of big data and the 5G era, in the process of communication, the number of information that needs to be forwarded is increasing. The traditional end-to-end communication mode has long been unable to meet the communication needs of modern people. Therefore, it is particularly important to improve the success rate of information forwarding under limited network resources. One method to improve the success rate of information forwarding in opportunistic social networks is to select appropriate relay nodes so as to reduce the number of hops and save network resources. However, the existing routing algorithms only consider how to select a more suitable relay node, but do not exclude untrusted nodes before choosing a suitable relay node. To select a more suitable relay node under the premise of saving network resources, a routing algorithm based on intuitionistic fuzzy decision-making model is proposed. By analyzing the real social scene, the algorithm innovatively proposes two universal measurement indexes of node attributes and quantifies the support degree and opposition degree of node social attributes to help node forward by constructing intuitionistic fuzzy decision-making matrix. The relay nodes are determined more accurately by using the multi-attribute decision-making method. Simulation results show that, in the best case, the forwarding success rate of IFMD algorithm is 0.93, and the average end-to-end delay, network load, and energy consumption are the lowest compared with Epidemic algorithm, Spray and Wait algorithm, NSFRE algorithm, and FCNS algorithm.<\/jats:p>","DOI":"10.3390\/sym13040664","type":"journal-article","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T21:47:33Z","timestamp":1618264053000},"page":"664","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Universal Routing Algorithm Based on Intuitionistic Fuzzy Multi-Attribute Decision-Making in Opportunistic Social Networks"],"prefix":"10.3390","volume":"13","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, National University of Defense Technology, Changsha 410073, China"}]}],"member":"1968","published-online":{"date-parts":[[2021,4,12]]},"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","first-page":"2898","DOI":"10.1109\/LCOMM.2020.3017889","article-title":"Node-oriented secure data transmission algorithm based on IoT system in social networks","volume":"24","author":"Li","year":"2020","journal-title":"IEEE Commun. Lett."},{"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":"1006","DOI":"10.1007\/s12083-020-01060-8","article-title":"Behavior prediction based on interest characteristic and user communication in opportunistic social networks","volume":"14","author":"Wu","year":"2021","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Xiao, Y., and Wu, J. (2020). Data transmission and management based on node communication in opportunistic social networks. Symmetry, 12.","DOI":"10.3390\/sym12081288"},{"key":"ref_6","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_7","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_8","doi-asserted-by":"crossref","first-page":"107465","DOI":"10.1016\/j.comnet.2020.107465","article-title":"Predicted Encounter Probability Based on Dynamic Programming Proposed Probability Algorithm in Opportunistic Social Network","volume":"181","author":"Yu","year":"2020","journal-title":"Comput. Netw."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Zhou, H., Wang, H., Zhu, C., and Leung, V.C.M. (2018, January 15\u201318). Freshness-aware initial seed selection for traffic offloading through opportunistic mobile networks. Proceedings of the 2018 IEEE Wireless Communications and Networking Conference (WCNC), Barcelona, Spain.","DOI":"10.1109\/WCNC.2018.8376987"},{"key":"ref_10","first-page":"1","article-title":"EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network","volume":"2018","author":"Lenando","year":"2018","journal-title":"Mob. Inf. Syst."},{"key":"ref_11","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_12","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_13","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_14","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1109\/COMST.2018.2796101","article-title":"Joint Inter-Flow Network Coding and Opportunistic Routing in Multi-Hop Wireless Mesh Networks: A Comprehensive Survey","volume":"20","author":"Kafaie","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_15","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_16","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.knosys.2018.08.024","article-title":"M-Skyline: Taking sunk cost and alternative recommendation in consideration for skyline query on uncertain data","volume":"163","author":"Zeng","year":"2019","journal-title":"Knowl. Based Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TNET.2018.2830414","article-title":"FUSO: Fast Multi-Path Loss Recovery for Data Center Networks","volume":"26","author":"Chen","year":"2018","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jnca.2014.03.007","article-title":"Human mobility in opportunistic networks: Characteristics, models and prediction methods","volume":"42","author":"Pirozmand","year":"2014","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_19","first-page":"2168","article-title":"Influence spread in geo-social networks: A multiobjective optimization perspective","volume":"2019","author":"Wang","year":"2019","journal-title":"IEEE Trans. Cybern."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"725","DOI":"10.15388\/Informatica.2017.153","article-title":"An approach for evaluating website quality in hotel industry based on triangular intuitionistic fuzzy numbers","volume":"28","author":"Stanujkic","year":"2017","journal-title":"Informatica"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.inffus.2018.07.006","article-title":"A social network based approach for consensus achievement in multiperson decision making","volume":"47","author":"Urena","year":"2019","journal-title":"Inf. Fusion"},{"key":"ref_22","first-page":"1","article-title":"Selective epidemic broadcast algorithm to suppress broadcast storm in vehicular ad hoc networks","volume":"19","author":"Xchitra","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":"369","DOI":"10.1016\/j.jpdc.2017.08.008","article-title":"A location prediction-based routing scheme for opportunistic networks in an IoT scenario","volume":"118","author":"Dhurandher","year":"2018","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"5301","DOI":"10.1109\/TVT.2016.2616034","article-title":"Optimal online data dissemination for resource constrained mobile opportunistic networks","volume":"66","author":"Liu","year":"2016","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s11276-015-1136-4","article-title":"CPTR: Conditional probability tree based routing in opportunistic networks","volume":"23","author":"Derakhshanfard","year":"2017","journal-title":"Wirel. Netw."},{"key":"ref_27","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_28","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1109\/LCOMM.2019.2900892","article-title":"Fair and social-aware message forwarding method in opportunistic social networks","volume":"23","author":"Ying","year":"2019","journal-title":"IEEE Commun. Lett."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"44840","DOI":"10.1109\/ACCESS.2019.2908920","article-title":"SSR: Using the social similarity to improve the data forwarding performance in mobile opportunistic networks","volume":"7","author":"Yuan","year":"2019","journal-title":"IEEE Access"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1007\/s12083-021-01072-y","article-title":"Low energy consumption routing algorithm based on message importance in opportunistic social networks","volume":"14","author":"Yin","year":"2021","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1186\/s13638-019-1397-1","article-title":"Quantitative social relations based on trust routing algorithm in opportunistic social network","volume":"2019","author":"Yu","year":"2019","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"ref_32","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_33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12083-020-00954-x","article-title":"Content Caching Based on Mobility Prediction and Joint User Prefetch in Mobile Edge Networks","volume":"13","author":"Yu","year":"2020","journal-title":"Peer-to-Peer Netw. Appl."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/4\/664\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:26:55Z","timestamp":1760362015000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/4\/664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,12]]},"references-count":33,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,4]]}},"alternative-id":["sym13040664"],"URL":"https:\/\/doi.org\/10.3390\/sym13040664","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2021,4,12]]}}}