{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:27:09Z","timestamp":1765974429254,"version":"3.41.2"},"reference-count":46,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T00:00:00Z","timestamp":1622246400000},"content-version":"vor","delay-in-days":148,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61966035"],"award-info":[{"award-number":["61966035"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>With the rapid development of 5G era, the number of messages on the network has increased sharply. The traditional opportunistic networks algorithm has some shortcomings in processing data. Most traditional algorithms divide the nodes into communities and then perform data transmission according to the divided communities. However, these algorithms do not consider enough nodes\u2019 characteristics in the communities\u2019 division, and two positively related nodes may divide into different communities. Therefore, how to accurately divide the community is still a challenging issue. We propose an efficient data transmission strategy for community detection (EDCD) algorithm. When dividing communities, we use mobile edge computing to combine network topology attributes with social attributes. When forwarding the message, we select optimal relay node as transmission according to the coefficients of channels. In the simulation experiment, we analyze the efficiency of the algorithm in four different real datasets. The results show that the algorithm has good performance in terms of delivery ratio and routing overhead.<\/jats:p>","DOI":"10.1155\/2021\/9928771","type":"journal-article","created":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T18:20:06Z","timestamp":1622312406000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Data Transmission for Community Detection Algorithm Based on Node Similarity in Opportunistic Social Networks"],"prefix":"10.1155","volume":"2021","author":[{"given":"Aizimaiti","family":"Xiaokaiti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6564-4745","authenticated-orcid":false,"given":"Yurong","family":"Qian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9013-0818","authenticated-orcid":false,"given":"Jia","family":"Wu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,5,29]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-020-00954-x"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.10.005"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-019-00833-0"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3766-9"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2019.04.021"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3576542"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2948941"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2905420"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-021-01072-y"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-020-01060-8"},{"key":"e_1_2_9_11_2","unstructured":"KarunanayakeE. P. N. Optimal relay node placement to improve design optimal relay node placement to improve expected life time in wireless sensor network design 2020."},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2015\/07\/p07008"},{"key":"e_1_2_9_13_2","first-page":"2031","article-title":"Federated learning in mobile edge networks: a comprehensive sur-vey","volume":"22","author":"Lim W. Y. B.","year":"2019","journal-title":"arXiv"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2016.2526058"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2014.12.012"},{"key":"e_1_2_9_16_2","doi-asserted-by":"crossref","unstructured":"GaoZ. MengJ. WangQ. andYangY. Data offloading for deadline-varying tasks in mobile edge computing Proceedings of the 2018 IEEE SmartWorld Ubiquitous Intelligence & Computing Advanced & Trusted Computing Scalable Computing & Communications Cloud & Big Data Computing Internet of People and Smart City Innovation (SmartWorld\/SCALCOM\/UIC\/ATC\/CBDCom\/IOP\/SCI) October 2018 Guangzhou China 1479\u20131484 https:\/\/doi.org\/10.1109\/SmartWorld.2018.00256 2-s2.0-85060283505.","DOI":"10.1109\/SmartWorld.2018.00256"},{"key":"e_1_2_9_17_2","doi-asserted-by":"crossref","unstructured":"ShiW. ZhaiL. OuyangM. andZhangJ. A mobile edge computing server deployment scheme in wireless mesh network Proceedings of the 2019 IEEE\/CIC International Conference on Communications Workshops in China (ICCC Workshops) August 2019 Changchun China 25\u201329 https:\/\/doi.org\/10.1109\/ICCChinaW.2019.8849934 2-s2.0-85073602382.","DOI":"10.1109\/ICCChinaW.2019.8849934"},{"key":"e_1_2_9_18_2","doi-asserted-by":"crossref","unstructured":"AdebayoA. RawatD. B. NiL. andSongM. Group-Query-as-a-Service for secure low-latency opportunistic RF spectrum access in mobile edge computing enabled wireless networks Proceedings of the 2018 27th International Conference on Computer Communication and Networks (ICCCN) July 2018 Hangzhou China 1\u20137 https:\/\/doi.org\/10.1109\/ICCCN.2018.8487432 2-s2.0-85060464916.","DOI":"10.1109\/ICCCN.2018.8487432"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-019-01480-2"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2016.09.015"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2018.1700274"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3721579"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-018-0649-x"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3017889"},{"key":"e_1_2_9_25_2","doi-asserted-by":"crossref","unstructured":"ZhuX. MaJ. SuX. TianH. WangW. andCaiS. Information spreading on weighted multiplex social network Complexity 2019 2019 5920187 https:\/\/doi.org\/10.1155\/2019\/5920187.","DOI":"10.1155\/2019\/5920187"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2017.2707492"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2898895"},{"volume-title":"Epidemic Routing for Partially Connected Ad Hoc Networks,\u201d Handbook of Systemic Autoimmune Diseases","year":"2000","author":"Vahdat A.","key":"e_1_2_9_28_2"},{"key":"e_1_2_9_29_2","doi-asserted-by":"crossref","unstructured":"SisodiyaS. SharmaP. andTiwariS. K. A new modified spray and wait routing algorithm for heterogeneous delay tolerant network Proceedings of the 2017 International Conference on I-SMAC (IoT in Social Mobile Analytics and Cloud) (I-SMAC) February 2017 Palladam India 843\u2013848 https:\/\/doi.org\/10.1109\/I-SMAC.2017.8058298 2-s2.0-85034573516.","DOI":"10.1109\/I-SMAC.2017.8058298"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2016.2630923"},{"key":"e_1_2_9_31_2","doi-asserted-by":"crossref","unstructured":"TangK. LiC. XiongH. ZouJ. andFrossardP. Reinforcement learning-based opportunistic routing for live video streaming over multi-hop wireless networks Proceedings of the 2017 IEEE 19th International Workshop on Multimedia Signal Processing (MMSP) May 2019 London UK 1\u20136 https:\/\/doi.org\/10.1109\/MMSP.2017.8122255 2-s2.0-85043530114.","DOI":"10.1109\/MMSP.2017.8122255"},{"key":"e_1_2_9_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1691-6"},{"key":"e_1_2_9_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2914505"},{"key":"e_1_2_9_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-017-4001-1"},{"key":"e_1_2_9_35_2","doi-asserted-by":"crossref","unstructured":"Dr\u01ceganR. CiobanuR. I. andDobreC. Leader election in opportunistic networks Proceedings of the 2017 IEEE 16th International Symposium on Parallel and Distributed Computing (ISPDC) July 2017 Innsbruck Austria https:\/\/doi.org\/10.1109\/ISPDC.2017.10 2-s2.0-85041661073.","DOI":"10.1109\/ISPDC.2017.10"},{"key":"e_1_2_9_36_2","doi-asserted-by":"publisher","DOI":"10.3390\/s17051109"},{"key":"e_1_2_9_37_2","doi-asserted-by":"publisher","DOI":"10.3390\/sym10080338"},{"key":"e_1_2_9_38_2","doi-asserted-by":"crossref","unstructured":"NiuJ. GuoJ. CaiQ. SadehN. andGuoS. Predict and spread: an efficient routing algorithm for opportunistic networking Proceedings of the 2011 IEEE Wireless Communications and Networking Conference March 2011 Cancun Mexico 498\u2013503 https:\/\/doi.org\/10.1109\/WCNC.2011.5779183 2-s2.0-79959298381.","DOI":"10.1109\/WCNC.2011.5779183"},{"key":"e_1_2_9_39_2","doi-asserted-by":"crossref","unstructured":"ZhangZ.andSaligramaV. Zero-shot learning via joint latent similarity embedding Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition June 2016 Seattle WA USA 6034\u20136042 https:\/\/doi.org\/10.1109\/CVPR.2016.649 2-s2.0-84986292720.","DOI":"10.1109\/CVPR.2016.649"},{"key":"e_1_2_9_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/tmm.2013.2293060"},{"key":"e_1_2_9_41_2","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nenA. OttJ. andK\u00e4rkk\u00e4inenT. The ONE simulator for DTN protocol evaluation Proceedings of the Second International ICST Conference on Simulation Tools and Techniques March 2009 Rome Italy https:\/\/doi.org\/10.4108\/ICST.SIMUTOOLS2009.5674 2-s2.0-84922954336.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"e_1_2_9_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-018-2675-0"},{"key":"e_1_2_9_43_2","doi-asserted-by":"crossref","unstructured":"RozemberczkiB. DaviesR. SarkarR. andSuttonC. Gemsec Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining August 2019 Vancouver Canada 65\u201372 https:\/\/doi.org\/10.1145\/3341161.3342890.","DOI":"10.1145\/3341161.3342890"},{"key":"e_1_2_9_44_2","doi-asserted-by":"crossref","unstructured":"LeskovecJ. HuttenlocherD. andKleinbergJ. Signed networks in social media Proceedings of the 28th International Conference on Human Factors in Computing Systems - CHI \u201810 April 2010 Atlanta GA USA 1361\u20131370 https:\/\/doi.org\/10.1145\/1753326.1753532 2-s2.0-77954012379.","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_2_9_45_2","doi-asserted-by":"crossref","unstructured":"MassaP. SalvettiM. andTomasoniD. Bowling alone and trust decline in social network sites Proceedings of the 2009 Eighth IEEE International Conference on Dependable Autonomic and Secure Computing December 2009 Chengdu China 658\u2013663 https:\/\/doi.org\/10.1109\/DASC.2009.130 2-s2.0-77950582679.","DOI":"10.1109\/DASC.2009.130"},{"key":"e_1_2_9_46_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/9928771.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/9928771.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/9928771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T21:55:13Z","timestamp":1723240513000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/9928771"}},"subtitle":[],"editor":[{"given":"Fei","family":"Xiong","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/9928771"],"URL":"https:\/\/doi.org\/10.1155\/2021\/9928771","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-03-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9928771"}}