{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:49:34Z","timestamp":1761648574813,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T00:00:00Z","timestamp":1534204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71633006","616725407"],"award-info":[{"award-number":["71633006","616725407"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"China Postdoctoral Science Foundation funded project","award":["2017M612586"],"award-info":[{"award-number":["2017M612586"]}]},{"name":"The Postdoctoral Science Foundation of Central South University","award":["185684"],"award-info":[{"award-number":["185684"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>With the popularization of mobile communication equipment, human activities have an increasing impact on the structure of networks, and so the social characteristics of opportunistic networks become increasingly obvious. Opportunistic networks are increasingly used in social situations. However, existing routing algorithms are not suitable for opportunistic social networks, because traditional opportunistic network routing does not consider participation in human activities, which usually causes a high ratio of transmission delay and routing overhead. Therefore, this research proposes an effective data transmission algorithm based on social relationships (ESR), which considers the community characteristics of opportunistic mobile social networks. This work uses the idea of the faction to divide the nodes in the network into communities, reduces the number of inefficient nodes in the community, and performs another contraction of the structure. Simulation results show that the ESR algorithm, through community transmission, is not only faster and safer, but also has lower transmission delay and routing overhead compared with the spray and wait algorithm, SCR algorithm and the EMIST algorithm.<\/jats:p>","DOI":"10.3390\/a11080125","type":"journal-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T10:31:16Z","timestamp":1534242676000},"page":"125","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4045-7251","authenticated-orcid":false,"given":"Yeqing","family":"Yan","sequence":"first","affiliation":[{"name":"School of Software, Central South University, Changsha 410075, China"},{"name":"\u201cMobile Health\u201d Ministry of Education-China Mobile Joint Laboratory, Changsha 410075, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhigang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Software, Central South University, Changsha 410075, China"},{"name":"\u201cMobile Health\u201d Ministry of Education-China Mobile Joint Laboratory, Changsha 410075, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9013-0818","authenticated-orcid":false,"given":"Jia","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Software, Central South University, Changsha 410075, China"},{"name":"\u201cMobile Health\u201d Ministry of Education-China Mobile Joint Laboratory, Changsha 410075, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3559-043X","authenticated-orcid":false,"given":"Leilei","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software, Central South University, Changsha 410075, China"},{"name":"\u201cMobile Health\u201d Ministry of Education-China Mobile Joint Laboratory, Changsha 410075, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/s12083-016-0526-4","article-title":"Sensor communication area and node extend routing algorithm in opportunistic networks","volume":"11","author":"Wu","year":"2016","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"ref_2","first-page":"279","article-title":"Performance Comparison of Routing Protocols in Mobile Ad Hoc Networks","volume":"2","author":"Roy","year":"2018","journal-title":"Int. J. Eng. Sci. Technol."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Mukherjee, A., Basu, S., Roy, S., and Bandyopadhyay, S. (2015, January 6\u201310). Developing a coherent global view for post disaster situation awareness using opportunistic network. Proceedings of the 2015 7th International Conference on Communication Systems and Networks, Bangalore, India.","DOI":"10.1109\/COMSNETS.2015.7098676"},{"key":"ref_4","first-page":"1","article-title":"Rare Wild Animal Tracking in the Forest area with Wireless Sensor Network in Network Simulator-2","volume":"133","author":"Ghumare","year":"2016","journal-title":"Int. J. Comput. Appl."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"5356","DOI":"10.1109\/ACCESS.2016.2603219","article-title":"Internet of Vehicles: Motivation, Layered Architecture, Network Model, Challenges, and Future Aspects","volume":"4","author":"Kaiwartya","year":"2017","journal-title":"IEEE Access"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.comnet.2017.10.005","article-title":"Effective information transmission based on socialization nodes in opportunistic networks","volume":"129","author":"Jia","year":"2017","journal-title":"Comput. Netw."},{"key":"ref_7","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_8","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_9","doi-asserted-by":"crossref","unstructured":"Ciobanu, R.I., Marin, R.C., Dobre, C., Cristea, V., and Mavromoustakis, C.X. (2014). ONSIDE: Socially-aware and Interest-based dissemination in opportunistic networks. Network Operations and Management Symposium, IEEE.","DOI":"10.1109\/NOMS.2014.6838390"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.comnet.2015.02.016","article-title":"ML-SOR: Message routing using multi-layer social networks in opportunistic communications","volume":"81","author":"Socievole","year":"2015","journal-title":"Comput. Netw."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Kumiawan, Z.H., Yovita, L.V., and Wibowo, T.A. (2017, January 13\u201315). Performance analysis of dLife routing in a delay tolerant networks. Proceedings of the 2016 International Conference on International Conference on Control, Electronics, Renewable Energy and Communications, Bandung, Indonesia.","DOI":"10.1109\/ICCEREC.2016.7814979"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MWC.2014.6845046","article-title":"Mobile traffic offloading by exploiting social network services and leveraging opportunistic device-to-device sharing","volume":"21","author":"Wang","year":"2014","journal-title":"Wirel. Commun. IEEE"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Wu, J., Chen, Z., and Zhao, M. (2018). Weight distribution and community reconstitution based on communities communications in social opportunistic networks. Peer-to-Peer Netw. Appl., 1\u201312.","DOI":"10.1007\/s12083-018-0649-x"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","article-title":"Index-based Densest Clique Percolation Community Search In Networks","volume":"30","author":"Yuan","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Neena, V.V., and Rajam, V.M.A. (2013, January 4\u20136). Performance analysis of epidemic routing protocol for opportunistic networks in different mobility patterns. Proceedings of the 2013 International Conference on International Conference on Computer Communication and Informatics, Coimbatore, India.","DOI":"10.1109\/ICCCI.2013.6466316"},{"key":"ref_16","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_17","unstructured":"Wan, B. (2017). An optimized Prophet delay tolerant network routing algorithm based on social environment. Wirel. Internet Technol."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Sisodiya, S., Sharma, P., and Tiwari, S.K. (2017, January 10\u201311). A new modified 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_19","doi-asserted-by":"crossref","unstructured":"Han, X., Yun, L., Zhang, Z., Li, J., and Xiong, F. (2016, January 25\u201328). A multi-label community discovery algorithm based on the community kernel. Proceedings of the 11th International Knowledge Management in Organizations Conference on The changing face of Knowledge Management Impacting Society, Hagen, Germany.","DOI":"10.1145\/2925995.2926011"},{"key":"ref_20","first-page":"16","article-title":"Efficient Routing using Bubble Rap in Delay Tolerant Network","volume":"137","author":"Jaimini","year":"2016","journal-title":"Int. J. Comput. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"4715","DOI":"10.12733\/jics20106438","article-title":"Research on Individual Influence in Social Networking Services Based on MapReduce","volume":"12","author":"Du","year":"2015","journal-title":"J. Inf. Comput. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Zhang, M., Chen, X., and Zhang, J. (2014, January 10\u201314). Social-aware relay selection for cooperative networking: An optimal stopping approach. Proceedings of the 2014 IEEE International Conference on Communications, Sydney, Australia.","DOI":"10.1109\/ICC.2014.6883659"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Cao, Y., Han, C., Zhang, X., Kaiwartya, O., Zhuang, Y., Aslam, N., and Dianati, M. A Trajectory-Driven Opportunistic Routing Protocol for VCPS. IEEE Trans. Aerosp. Electron. Syst., 2018.","DOI":"10.1109\/TAES.2018.2826201"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1049\/iet-its.2016.0241","article-title":"Location error resilient geographical routing for vehicular ad-hoc networks","volume":"11","author":"Kasana","year":"2017","journal-title":"IET Intell. Transp. Syst."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2691","DOI":"10.1016\/j.physleta.2017.06.018","article-title":"Label propagation algorithm for community detection based on node importance and label influence","volume":"381","author":"Zhang","year":"2017","journal-title":"Phys. Lett. A"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., and Raghavendra, C.S. (2005, January 22\u201326). 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_27","unstructured":"Hornig, R. (2008, January 3\u20137). An overview of the OMNeT++ simulation environment. Proceedings of the International Conference on Simulation TOOLS and Techniques for Communications, Networks and Systems & Workshops, Marseille, France."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Wu, J., Chen, Z., and Zhao, M. (2018). Information Transmission Probability and Cache Management Method in Opportunistic Networks. Wirel. Commun. Mob. Comput.","DOI":"10.1155\/2018\/1571974"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/8\/125\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:18:45Z","timestamp":1760195925000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/8\/125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,14]]},"references-count":28,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2018,8]]}},"alternative-id":["a11080125"],"URL":"https:\/\/doi.org\/10.3390\/a11080125","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2018,8,14]]}}}