{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T01:55:30Z","timestamp":1781315730236,"version":"3.54.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004735","name":"natural science foundation of\u00a0hunan province","doi-asserted-by":"publisher","award":["2018JJ3299"],"award-info":[{"award-number":["2018JJ3299"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012476","name":"fundamental research funds for central universities of the central south university","doi-asserted-by":"publisher","award":["2020zzts611"],"award-info":[{"award-number":["2020zzts611"]}],"id":[{"id":"10.13039\/501100012476","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s12083-021-01286-0","type":"journal-article","created":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T05:02:49Z","timestamp":1641358969000},"page":"811-826","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient path-sense transmission based on IoT system in opportunistic social networks"],"prefix":"10.1007","volume":"15","author":[{"given":"Xiaoli","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huamei","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,5]]},"reference":[{"issue":"9","key":"1286_CR1","doi-asserted-by":"publisher","first-page":"4314","DOI":"10.1109\/TVT.2011.2172823","volume":"60","author":"L Cai","year":"2011","unstructured":"Cai L, Xiang S, Luo Y, Pan J (2011) Scalable modulation for video transmission in wireless net-\u00a0works. IEEE Trans Veh Tech 60(9):4314\u20134323","journal-title":"IEEE Trans Veh Tech"},{"issue":"4","key":"1286_CR2","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1109\/TWC.2013.022013.120266","volume":"12","author":"X Wang","year":"2013","unstructured":"Wang X, Cai L (2013) Proportional fair scheduling in hierarchical modulation aided wireless networks. IEEE Trans Wirel Commun 12(4):1584\u20131593","journal-title":"IEEE Trans Wirel Commun"},{"issue":"12","key":"1286_CR3","doi-asserted-by":"publisher","first-page":"7950","DOI":"10.1109\/TWC.2017.2755026","volume":"16","author":"H Zhang","year":"2017","unstructured":"Zhang H, Cai L (2017) Bi-directional multi-hop wireless pipeline using physical-layer network coding. IEEE Trans Wireless Commun 16(12):7950\u20137965","journal-title":"IEEE Trans Wireless Commun"},{"issue":"1","key":"1286_CR4","doi-asserted-by":"publisher","first-page":"59002","DOI":"10.1109\/ACCESS.2019.2915359","volume":"7","author":"J Wu","year":"2019","unstructured":"Wu J, Yu G, Guan P (2019) Interest characteristic probability predicted method in social opportunistic networks. IEEE ACCESS 7(1):59002\u201359012","journal-title":"IEEE ACCESS"},{"issue":"6","key":"1286_CR5","doi-asserted-by":"publisher","first-page":"2977","DOI":"10.1007\/s11276-018-1691-6","volume":"25","author":"J Wu","year":"2019","unstructured":"Wu J, Chen Z, Zhao M (2019) Information cache management and data transmission algorithm in opportunistic social networks. Wirel Netw 25(6):2977\u20132988","journal-title":"Wirel Netw"},{"issue":"1","key":"1286_CR6","doi-asserted-by":"crossref","first-page":"12405","DOI":"10.1109\/ACCESS.2019.2893308","volume":"7","author":"GUAN Peiyuan","year":"2019","unstructured":"Peiyuan GUAN, Jia WU (2019) Effective data communication based on social community in social opportunistic networks. IEEE ACCESS 7(1):12405\u201312414","journal-title":"IEEE ACCESS"},{"issue":"2","key":"1286_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s12083-016-0438-3","volume":"10","author":"X Wang","year":"2017","unstructured":"Wang X et al (2017) A novel approach for inhibiting misinformation propagation in human mobile opportunistic networks. Peer-to-Peer Netw Appl 10(2):377\u2013394","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"1","key":"1286_CR8","first-page":"187","volume":"29","author":"Y Zhuang","year":"2011","unstructured":"Zhuang Y, Pan J, Luo Y, Cai L (2011) Time and location-critical emergency message dissemina- tion for vehicular ad-hoc networks. IEEE JSAC, special issue on Veh Commun Netw 29(1):187\u2013196","journal-title":"IEEE JSAC, special issue on Veh Commun Netw"},{"key":"1286_CR9","doi-asserted-by":"crossref","unstructured":"Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D (2002) Energy-Efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet.\u00a0In: Proc. of the 10th Int\u2019l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 96\u2212107","DOI":"10.1145\/605432.605408"},{"key":"1286_CR10","doi-asserted-by":"crossref","unstructured":"Gou F, Wu J (2022)\u00a0Triad link prediction method based on the evolutionary analysis with IoT in opportunistic social networks.\u00a0Comput Commun\u00a012th Oct, 181C:143\u2013155","DOI":"10.1016\/j.comcom.2021.10.009"},{"key":"1286_CR11","doi-asserted-by":"publisher","unstructured":"Yang W, Luo J\u00a0(2021) Application of information transmission control strategy based on incremental community division in IoT platform. IEEE Sensors J Oct 1st, 21(19):21968\u201321978.\u00a0https:\/\/doi.org\/10.1109\/JSEN.2021.3102683","DOI":"10.1109\/JSEN.2021.3102683"},{"key":"1286_CR12","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.3390\/electronics10131595","volume":"10","author":"Y Dong","year":"2021","unstructured":"Dong Y, Chang L, Luo J et al (2021) A routing query algorithm based on time-varying relationship group in opportunistic social networks. Electronics 10:1595. https:\/\/doi.org\/10.3390\/electronics10131595","journal-title":"Electronics"},{"issue":"12","key":"1286_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TWC.2016.2550028","volume":"15","author":"S Wu","year":"2016","unstructured":"Wu S et al (2016) Node Service Ability Aware Packet Forwarding Mechanism in Intermittently Connected Wireless Networks. IEEE Trans Wirel Commun 15(12):1\u20131","journal-title":"IEEE Trans Wirel Commun"},{"issue":"2","key":"1286_CR14","first-page":"176","volume":"25","author":"K Chen","year":"2017","unstructured":"Chen K, Shen H (2017) FaceChange: Attaining neighbor node anonymity in mobile opportunistic social networks with fine-grained control. IEEE\/ACM Trans\u00a0Netw 25(2):176\u20131189","journal-title":"IEEE\/ACM Trans\u00a0Netw"},{"key":"1286_CR15","doi-asserted-by":"publisher","unstructured":"Deng Y, Gou F (2021) Hybrid\u00a0data transmission scheme based on source node centrality and community reconstruction in opportunistic social networks.\u00a0Peer-to-Peer Netwo Appl\u00a01\u201313.\u00a0https:\/\/doi.org\/10.1007\/s12083-021-01205-3","DOI":"10.1007\/s12083-021-01205-3"},{"issue":"10","key":"1286_CR16","doi-asserted-by":"publisher","first-page":"2876","DOI":"10.1109\/TMC.2017.2673842","volume":"16","author":"BK Saha","year":"2017","unstructured":"Saha BK, Misra S, Pal S (2017) SeeR: Simulated annealing-based routing in opportunistic mobile networks. IEEE Trans Mob Comput 16(10):2876\u20132888","journal-title":"IEEE Trans Mob Comput"},{"key":"1286_CR17","doi-asserted-by":"crossref","unstructured":"Huang R, Lin Y, Ying B, Nayak A (2018) ACP: An Efficient User Location Privacy Preserving Protocol for Opportunistic Mobile Social Networks. IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC), Tokyo 610\u2013619","DOI":"10.1109\/COMPSAC.2018.00093"},{"key":"1286_CR18","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.3390\/electronics10101138","volume":"10","author":"Y Lu","year":"2021","unstructured":"Lu Y, Chang L, Luo J (2021) Routing algorithm based on user adaptive data transmission scheme in opportunistic social networks. Electronics 10:1138. https:\/\/doi.org\/10.3390\/electronics10101138","journal-title":"Electronics"},{"key":"1286_CR19","doi-asserted-by":"crossref","unstructured":"Newman ME (2004) Analysis of weighted networks. PhRvE 70","DOI":"10.1103\/PhysRevE.70.056131"},{"issue":"4","key":"1286_CR20","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1007\/s11277-016-3323-8","volume":"89","author":"SR Azzuhri","year":"2016","unstructured":"Azzuhri SR et al (2016) An efficient hybrid MANET-DTN routing scheme for OLSR. Wirel Pers Commun 89(4):1335\u20131354","journal-title":"Wirel Pers Commun"},{"key":"1286_CR21","doi-asserted-by":"publisher","first-page":"3141","DOI":"10.1007\/s12652-019-01480-2","volume":"11","author":"J Wu","year":"2020","unstructured":"Wu J, Chen Z, Zhao M (2020) An efficient data packet iteration and transmission algorithm in opportunistic social networks. J Ambient Intell Humaniz Comput 11:3141\u20133153. https:\/\/doi.org\/10.1007\/s12652-019-01480-2","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"1286_CR22","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.3390\/electronics10091128","volume":"10","author":"Z Fang","year":"2021","unstructured":"Fang Z, Chang L, Luo J et al (2021) A data transmission algorithm based on triangle link structure prediction in opportunistic social networks. Electronics 10:1128. https:\/\/doi.org\/10.3390\/electronics10091128","journal-title":"Electronics"},{"issue":"4","key":"1286_CR23","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1109\/TWC.2014.2382639","volume":"14","author":"M Ni","year":"2015","unstructured":"Ni M, Pan J, Cai L (2015) Geometrical-based throughput analysis of device-to-device communications in a sector-partitioned cell. IEEE Trans Wirel Commun 14(4):2232\u20132244","journal-title":"IEEE Trans Wirel Commun"},{"key":"1286_CR24","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.compbiomed.2019.04.021","volume":"109","author":"J Wu","year":"2019","unstructured":"Wu J, Tian X, Tan Y (2019) Hospital evaluation mechanism based on mobile health for IoT system in social networks. Comput Biol Med 109:138\u2013147","journal-title":"Comput Biol Med"},{"issue":"1","key":"1286_CR25","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1109\/TWC.2016.2625301","volume":"16","author":"F Tong","year":"2017","unstructured":"Tong F, Wan Y, Zheng L, Pan J, Cai L (2017) A probabilistic distance-based modeling and analysis for cellular networks with underlaying device-to-device communications. IEEE Trans Wirel Commun 16(1):451\u2013463","journal-title":"IEEE Trans Wirel Commun"},{"key":"1286_CR26","doi-asserted-by":"publisher","first-page":"51772","DOI":"10.1109\/ACCESS.2021.3069992","volume":"9","author":"X Wu","year":"2021","unstructured":"Wu X, Chang L, Luo J et al (2021) Efficient edge cache collaboration transmission strategy of opportunistic social network in trusted community. IEEE ACCESS 9:51772\u201351783. https:\/\/doi.org\/10.1109\/ACCESS.2021.3069992","journal-title":"IEEE ACCESS"},{"key":"1286_CR27","doi-asserted-by":"crossref","unstructured":"Goel A, Rai  S, Krishnamachari B (2004) Sharp\u00a0thresholds for monotone properties in random geometric graphs. Thirty-sixth ACM Symposium on Theory of Computing\u00a0ACM","DOI":"10.1145\/1007352.1007441"},{"issue":"11","key":"1286_CR28","doi-asserted-by":"publisher","first-page":"2458","DOI":"10.1109\/TMC.2014.2314128","volume":"13","author":"L Zhang","year":"2014","unstructured":"Zhang L, Cai L, Pan J, Tong F (2014) A new approach to the directed connectivity in two- dimensional lattice networks. IEEE Trans Mob Comput 13(11):2458\u20132472","journal-title":"IEEE Trans Mob Comput"},{"key":"1286_CR29","doi-asserted-by":"crossref","unstructured":"Fernandez-Marquez JL et al (2014) The ONE-SAPERE simulator: a prototyping tool for engineering self-organisation in pervasive environments.\u00a02014 IEEE 8th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)\u00a0IEEE","DOI":"10.1109\/SASO.2014.44"},{"key":"1286_CR30","doi-asserted-by":"publisher","unstructured":"Wu J,  Gou F, Xiong W  and Zhou X(2021) A Reputation Value-based Task-sharing Strategy in Opportunistic Complex Social Networks. Complexity. Volume 2021 , Article ID 8554351, 15 pages. https:\/\/doi.org\/10.1155\/2021\/8554351.","DOI":"10.1155\/2021\/8554351"},{"key":"1286_CR31","doi-asserted-by":"crossref","unstructured":"Wang G, Wang B, Gao Y (2010) Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. International Conference on Communications & Mobile Computing IEEE Computer Society","DOI":"10.1109\/CMC.2010.83"},{"key":"1286_CR32","doi-asserted-by":"crossref","unstructured":"Liu K, Chen Z, Wu J, Wang L (2018)\u00a0FCNS: A fuzzy routing-forwarding algorithm exploiting comprehensive mode similarity in opportunistic social networks. Symmetry\u00a010.8","DOI":"10.3390\/sym10080338"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-021-01286-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-021-01286-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-021-01286-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T02:22:36Z","timestamp":1642645356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-021-01286-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1286"],"URL":"https:\/\/doi.org\/10.1007\/s12083-021-01286-0","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"23 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. The authors declare none financial interests\/personal relationships which may be considered as potential competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}