{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:20:24Z","timestamp":1761402024966,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T00:00:00Z","timestamp":1569456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Scientific Research Fund of Hunan Provincial Education Department, Research on database storage performance optimization in virtualization","award":["No. 16C1498"],"award-info":[{"award-number":["No. 16C1498"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Recently, with the development of big data and 5G networks, the number of intelligent mobile devices has increased dramatically, therefore the data that needs to be transmitted and processed in the networks has grown exponentially. It is difficult for the end-to-end communication mechanism proposed by traditional routing algorithms to implement the massive data transmission between mobile devices. Consequently, opportunistic social networks propose that the effective data transmission process could be implemented by selecting appropriate relay nodes. At present, most existing routing algorithms find suitable next-hop nodes by comparing the similarity degree between nodes. However, when evaluating the similarity between two mobile nodes, these routing algorithms either consider the mobility similarity between nodes, or only consider the social similarity between nodes. To improve the data dissemination environment, this paper proposes an effective data transmission strategy (MSSN) utilizing mobile and social similarities in opportunistic social networks. In our proposed strategy, we first calculate the mobile similarity between neighbor nodes and destination, set a mobile similarity threshold, and compute the social similarity between the nodes whose mobile similarity is greater than the threshold. The nodes with high mobile similarity degree to the destination node are the reliable relay nodes. After simulation experiments and comparison with other existing opportunistic social networks algorithms, the results show that the delivery ratio in the proposed algorithm is 0.80 on average, the average end-to-end delay is 23.1% lower than the FCNS algorithm (A fuzzy routing-forwarding algorithm exploiting comprehensive node similarity in opportunistic social networks), and the overhead on average is 14.9% lower than the Effective Information Transmission Based on Socialization Nodes (EIMST) algorithm.<\/jats:p>","DOI":"10.3390\/info10100299","type":"journal-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T03:03:15Z","timestamp":1569553395000},"page":"299","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["MSSN: An Attribute-Aware Transmission Algorithm Exploiting Node Similarity for Opportunistic Social Networks"],"prefix":"10.3390","volume":"10","author":[{"given":"Mei","family":"Guo","sequence":"first","affiliation":[{"name":"School of Software and Communication Engineering, Xiangnan University, Chenzhou 423000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Xiao","sequence":"additional","affiliation":[{"name":"School of Software and Communication Engineering, Xiangnan University, Chenzhou 423000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,9,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/MCOM.2014.6710069","article-title":"Mobile Ad Hoc Networking: Milestones, Challenges, and New Research Directions","volume":"52","author":"Conti","year":"2014","journal-title":"Commun. Mag. IEEE"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1016\/j.im.2016.03.006","article-title":"Do you get tired of socializing? An empirical explanation of discontinuous usage behaviour in social network services","volume":"53","author":"Zhang","year":"2016","journal-title":"Inf. Manag."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.future.2017.07.028","article-title":"Security-oriented opportunistic data forwarding in Mobile Social Networks","volume":"87","author":"Wu","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"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 Int., 10.","key":"ref_4","DOI":"10.3390\/fi10080074"},{"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 Basel, 10.","key":"ref_5","DOI":"10.3390\/sym10080338"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1587\/transcom.E98.B.99","article-title":"Location-Aware Store-Carry-Forward Routing Based on Node Density Estimation","volume":"98","author":"Kimura","year":"2015","journal-title":"IEICE Trans. Commun."},{"doi-asserted-by":"crossref","unstructured":"Kimura, T., and Muraguchi, M. (2017, January 11\u201313). Buffer management policy based on message rarity for store-carry-forward routing. Proceedings of the 2017 23rd Asia-Pacific Conference on Communications (APCC), Perth, WA, Australia.","key":"ref_7","DOI":"10.23919\/APCC.2017.8303994"},{"unstructured":"Peng, Y., Guo, L., and Deng, Q.X. (2015, January 24\u201326). A Novel Hybrid Routing Forwarding Algorithm in SDN Enabled Wireless Mesh Networks. Proceedings of the IEEE International Conference on High Performance Computing and Communications, New York, NY, USA.","key":"ref_8"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1109\/JSAC.2016.2525439","article-title":"User Mobility Evaluation for 5G Small Cell Networks Based on Individual Mobility Model","volume":"34","author":"Ge","year":"2016","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1812","DOI":"10.1002\/sec.1116","article-title":"Security and trust management in opportunistic networks: A survey","volume":"8","author":"Wu","year":"2015","journal-title":"Secur. Commun. Netw."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2348","DOI":"10.1109\/ACCESS.2018.2886198","article-title":"Big Medical Data Decision-Making Intelligent System Exploiting Fuzzy Inference Logic for Prostate Cancer in Developing Countries","volume":"7","author":"Liu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/JIOT.2019.2896749","article-title":"Guest Editorial Special Issue on 5G and Beyond\u2014Mobile Technologies and Applications for IoT","volume":"6","author":"Mumtaz","year":"2019","journal-title":"IEEE Int. Things J."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MNET.2015.7064901","article-title":"Mobile cloud sensing, big data, and 5G networks make an intelligent and smart world","volume":"29","author":"Han","year":"2015","journal-title":"IEEE Netw."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"10259","DOI":"10.1109\/TVT.2017.2717949","article-title":"An Agile Confidential Transmission Strategy Combining Big Data Driven Cluster and OBF","volume":"66","author":"Han","year":"2017","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_15","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_16","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.compeleceng.2015.12.023","article-title":"Opportunistic large array concentric routing algorithms with relay nodes for wireless sensor networks","volume":"56","author":"Ke","year":"2016","journal-title":"Comput. Electr. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.pmcj.2017.08.004","article-title":"A novel mathematical framework for similarity-based opportunistic social networks","volume":"42","author":"Elsherief","year":"2017","journal-title":"Perv. Mobile Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TWC.2015.2476466","article-title":"Secure Routing based on Social Similarity in Opportunistic Networks","volume":"15","author":"Yao","year":"2015","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2594455","article-title":"Joint Link Prediction and Attribute Inference Using a Social-Attribute Network","volume":"5","author":"Gong","year":"2014","journal-title":"ACM Trans. Int. Syst. Technol."},{"key":"ref_20","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":"Jia","year":"2019","journal-title":"Wirel. Netw."},{"doi-asserted-by":"crossref","unstructured":"Jiang, N., Guo, L., and Li, J. (2016, January 13\u201316). Data Dissemination Protocols Based on Opportunistic Sharing for Data Offloading in Mobile Social Networks. Proceedings of the.2016 IEEE International Conference on Parallel & Distributed Systems, Wuhan, China.","key":"ref_21","DOI":"10.1109\/ICPADS.2016.0097"},{"key":"ref_22","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":"In Proceedings of IEEE Commun Lett."},{"key":"ref_23","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":"Jia","year":"2019","journal-title":"J. Supercomput."},{"unstructured":"Lin, C.J., Chen, C.W., and Chou, C.F. (2012, January 25\u201330). Preference-aware content dissemination in opportunistic mobile social networks. Proceedings of the 2012 Proceedings IEEE INFOCOM, Orlando, FL, USA.","key":"ref_24"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.comnet.2009.09.001","article-title":"Design and performance evaluation of ContentPlace, a social-aware data dissemination system for opportunistic networks","volume":"54","author":"Boldrini","year":"2010","journal-title":"Comput. Netw."},{"unstructured":"Conti, M., Mordacchini, M., and Passarella, A. (2016). A Semantic-Based Algorithm for Data Dissemination in Opportunistic Networks. Revised Selected Papers of Ifip Tc 6 International Workshop on Self-Organizing Systems, Springer.","key":"ref_26"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1049\/iet-net.2018.5106","article-title":"Energy Aware Routing for Efficient Green Communication in Opportunistic Networks","volume":"8","author":"Woungang","year":"2019","journal-title":"IET Netw."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.future.2019.02.017","article-title":"Socially-aware congestion control in ad-hoc networks: Current status and the way forward","volume":"97","author":"Liaqat","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.pmcj.2017.06.006","article-title":"A social cognitive heuristic for adaptive data dissemination in mobile Opportunistic Networks","volume":"42","author":"Mordacchini","year":"2017","journal-title":"Pervasive Mobile Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.adhoc.2019.01.001","article-title":"Efficient broadcast in opportunistic networks using optimal stopping theory","volume":"88","author":"Borrego","year":"2019","journal-title":"Ad Hoc Netw."},{"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."},{"doi-asserted-by":"crossref","unstructured":"Souza, C., Mota, E., Soares, D., Manzoni, P., Cano, J.C., Calafate, C.T., and Hern\u00e1ndez-Orallo, E. (2019). FSF: Applying Machine Learning Techniques to Data Forwarding in Socially Selfish Opportunistic Networks. Sensors, 19.","key":"ref_32","DOI":"10.3390\/s19102374"},{"unstructured":"Zhao, Y., Song, W., and Han, Z. (1939). Social-Aware Data Dissemination via Device-to-Device Communications: Fusing Social and Mobile Networks with Incentive Constraints. IEEE Trans. Serv. Comput., 1.","key":"ref_33"},{"key":"ref_34","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. Mod. Phys. C"},{"unstructured":"Huang, W., Zhang, S., and Zhou, W. (2011, January 11\u201313). Spray and Wait Routing Based on Position Prediction in Opportunistic Networks. Proceedings of the 2011 3rd International Conference on Computer Research & Development, Shanghai, China.","key":"ref_35"},{"key":"ref_36","first-page":"1","article-title":"EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network","volume":"2018","author":"Halikul","year":"2018","journal-title":"Mob. Inf. Sys."},{"key":"ref_37","first-page":"129","article-title":"Effective information transmission based on socialization nodes in opportunistic networks","volume":"129","author":"Jia","year":"2017","journal-title":"Comput. Netw."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/10\/299\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:24:44Z","timestamp":1760189084000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/10\/299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,26]]},"references-count":37,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2019,10]]}},"alternative-id":["info10100299"],"URL":"https:\/\/doi.org\/10.3390\/info10100299","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2019,9,26]]}}}