{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T07:19:29Z","timestamp":1778570369634,"version":"3.51.4"},"reference-count":22,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T00:00:00Z","timestamp":1596412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Due to the rapid popularization of various short distance communication mobile devices, the use scenarios of opportunistic networks are increasing day by day. However, in opportunistic networks, because of the complexity of community structure, many methods lack of symmetry between application and theoretical research. Thus, the connection strength between nodes is different, and the degree of message diffusion is different. If the above factors cannot be accurately estimated and analyzed, and effective data forwarding and scheduling strategies cannot be formulated, the delivery ratio will be low, the delay will be relatively high, and the network overhead will be large. In light of improving symmetry problems in opportunistic networks, this paper establishes the message duplicate adaptive allocation and spray routing strategy (MDASRS) algorithm model, measures the connection strength between nodes through social pressure, and estimates the diffusion of current messages in the network through the probability of messages leaving the current node successfully, so as to develop the self-adaptive control replication transmission mode and achieve the effect of reducing the network burden and network overhead. This is done through experiments and comparison of social network algorithms, comparing the MDASRS with Epidemic, Spray and Wait, and EIMST algorithms. The experiment results showed that this method improves the cache utilization of nodes, reduces data transmission delay, and improves the network\u2019s overall efficiency.<\/jats:p>","DOI":"10.3390\/sym12081288","type":"journal-article","created":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T09:02:48Z","timestamp":1596445368000},"page":"1288","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Data Transmission and Management Based on Node Communication in Opportunistic Social Networks"],"prefix":"10.3390","volume":"12","author":[{"given":"Yutong","family":"Xiao","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, 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 Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,8,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1007\/s12083-019-00833-0","article-title":"Community recombination and duplication node traverse algorithm in opportunistic social networks","volume":"13","author":"Wu","year":"2020","journal-title":"Peer Peer Netw. Appl."},{"key":"ref_2","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":"Wu","year":"2017","journal-title":"Comput. Netw."},{"key":"ref_3","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":"2018","journal-title":"Peer Peer Netw. Appl."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"12405","DOI":"10.1109\/ACCESS.2019.2893308","article-title":"Effective data communication based on social community in social opportunistic networks","volume":"7","author":"Guan","year":"2019","journal-title":"IEEE Access"},{"key":"ref_5","first-page":"600","article-title":"Research progress on routing problem in mobile opportunistic networks","volume":"26","author":"Ma","year":"2015","journal-title":"J. Softw."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2297","DOI":"10.1109\/TPDS.2013.170","article-title":"Flooding time in opportunistic networks under power law and exponential intercontact times","volume":"25","author":"Becchetti","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Michalski, R., and Kazienko, P. (2015). Maximizing social influence in real-world networks\u2014The state of the art and current challenges. Propagation Phenomena in Real World Networks, Springer International Publishing.","DOI":"10.1007\/978-3-319-15916-4_14"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Wang, X., Leng, S., Yin, J., Fan, B., and Yang, K. (2015, January 6\u201310). ESD: An energy saving data delivery scheme in mobile social networks. Proceedings of the IEEE Global Communications Conference (GLOBECOM), San Diego, CA, USA.","DOI":"10.1109\/GLOCOM.2015.7417686"},{"key":"ref_9","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_10","first-page":"71","article-title":"Optimal forwarding and beaconing control of epidemic routing in delay tolerant networks","volume":"20","author":"Wu","year":"2014","journal-title":"Adhoc Sens. Wirel. Netw."},{"key":"ref_11","first-page":"1","article-title":"Improved epidemic algorithm based on trust mechanism in opportunistic networks","volume":"3","author":"Zhang","year":"2017","journal-title":"Chin. J. Netw. Inf. Secur."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1002\/dac.2688","article-title":"Epidemic routing based on adaptive compression of vectors: Efficient low -delay routing for opportunistic networks based on adaptive compression of vectors","volume":"28","author":"Ren","year":"2015","journal-title":"Int. J. Commun. Syst."},{"key":"ref_13","unstructured":"Kim, E.-H., Nam, J.-C., Choi, J.-I., and Cho, Y.-Z. (2014, January 10\u201312). Probability-based spray and wait protocol in delay tolerant networks. Proceedings of the International Conference on Information Networking (IEEE 2014), Phuket, Thailand."},{"key":"ref_14","first-page":"57","article-title":"Nodal sociality-based data forwarding for opportunistic networks","volume":"45","author":"Peng","year":"2013","journal-title":"J. Sichuan Univ. (Eng. Sci. Ed.)"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2040","DOI":"10.1587\/transcom.E98.B.2040","article-title":"Exploiting social relationship for opportunistic routing in mobile social networks","volume":"98","author":"Gao","year":"2015","journal-title":"IEICE Trans. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Luo, J., Wu, J., and WU, Y. (2020). Advanced Data Delivery Strategy Base on Multi-Perceived Community with IoT in Social Complex Networks. Complexity, 2020.","DOI":"10.1155\/2020\/3576542"},{"key":"ref_17","first-page":"800","article-title":"Effective data forwarding strategy integrating social relationships in opportunistic networks","volume":"13","author":"Yan","year":"2019","journal-title":"J. Front. Comput. Sci. Technol."},{"key":"ref_18","unstructured":"Yang, W., Wu, J., and Luo, J. (2018). Effective date transmission and control base on social communication in social opportunistic complex networks. Alghorithms, 11."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez-Orallo, E., Cano, J.-C., Calafate, C.T., and Manzoni, P. (2013, January 1\u20133). A representative and accurate characterization of inter-contact times in mobile opportunistic networks. Proceedings of the 16th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (ACM 2013), Barcelona, Spain.","DOI":"10.1145\/2507924.2507936"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1109\/COMST.2017.2782182","article-title":"Simulating Opportunistic networks: Survey and future directions","volume":"20","author":"Dede","year":"2017","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Herrera-Tapia, J., Hern\u00e1ndez-Orallo, E., Manzoni, P., Tomas, A., Tavares Calafate, C., and Cano, J.-C. (2016, January 18\u201321). Evaluating the impact of data transfer time and mobility patterns in opportunistic networks. Proceedings of the 2016 Intl IEEE Conferences on Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (IEEE 2017), Touluse, France.","DOI":"10.1109\/UIC-ATC-ScalCom-CBDCom-IoP-SmartWorld.2016.0027"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Herrera-Tapia, J., Hern\u00e1ndez-Orallo, E., Andr\u00e9s, T., Manzoni, P., Tomas, A., Tavares Calafate, C., and Cano, J.-C. (2016). Improving message delivery performance in opportunistic networks using a forced-stop diffusion scheme. Ad-Hoc, Mobile and Wireless Networks, Springer.","DOI":"10.1007\/978-3-319-40509-4_11"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/8\/1288\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:54:01Z","timestamp":1760176441000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/8\/1288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,3]]},"references-count":22,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2020,8]]}},"alternative-id":["sym12081288"],"URL":"https:\/\/doi.org\/10.3390\/sym12081288","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,3]]}}}