{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T02:08:09Z","timestamp":1768097289860,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T00:00:00Z","timestamp":1568160000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T00:00:00Z","timestamp":1568160000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672540"],"award-info":[{"award-number":["61672540"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s12652-019-01480-2","type":"journal-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T11:03:01Z","timestamp":1568199781000},"page":"3141-3153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["An efficient data packet iteration and transmission algorithm in opportunistic social networks"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9013-0818","authenticated-orcid":false,"given":"Jia","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhigang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,11]]},"reference":[{"issue":"3","key":"1480_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s12652-010-0013-3","volume":"1","author":"M Calabrese","year":"2010","unstructured":"Calabrese M, Amato A, Lecce VD et al (2010) Hierarchical-granularity holonic modelling. J Ambient Intell Hum Comput 1(3):199\u2013209. \nhttps:\/\/doi.org\/10.1007\/s12652-010-0013-3","journal-title":"J Ambient Intell Hum Comput"},{"key":"1480_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-29336-8_11","volume":"76","author":"H Cheng","year":"2012","unstructured":"Cheng H, Sun F, Buthpitiya S, Griss M (2012) SensOrchestra: collaborative sensing for symbolic location recognition. Mob Comput Appl Serv 76:195\u2013210. \nhttps:\/\/doi.org\/10.1007\/978-3-642-29336-8_11","journal-title":"Mob Comput Appl Serv"},{"issue":"13","key":"1480_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10796-010-9273-x","volume":"13","author":"M Cheong","year":"2018","unstructured":"Cheong M, Lee VCS (2018) A microblogging-based approach to terrorism informatics: exploration and chronicling civilian sentiment and response to terrorism events via Twitter. Inf Syst Front 13(13):45\u201359. \nhttps:\/\/doi.org\/10.1007\/s10796-010-9273-x","journal-title":"Inf Syst Front"},{"issue":"1","key":"1480_CR4","doi-asserted-by":"publisher","first-page":"12405","DOI":"10.1109\/ACCESS.2019.2893308","volume":"7","author":"P Guan","year":"2019","unstructured":"Guan P, Wu J (2019) Effective data communication based on social community in social opportunistic networks. IEEE Access 7(1):12405\u201312414. \nhttps:\/\/doi.org\/10.1109\/ACCESS.2019.2893308","journal-title":"IEEE Access"},{"issue":"5","key":"1480_CR5","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/tmc.2011.101","volume":"11","author":"B Han","year":"2012","unstructured":"Han B, Pan H, Kumar A (2012) Mobile data offloading through opportunistic communications and social participation. IEEE Trans Mob Comput 11(5):821\u2013834. \nhttps:\/\/doi.org\/10.1109\/tmc.2011.101","journal-title":"IEEE Trans Mob Comput"},{"issue":"1","key":"1480_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s12652-010-0038-7","volume":"2","author":"Z Jaroucheh","year":"2011","unstructured":"Jaroucheh Z (2011) Recognize contextual situation in pervasive environments using process miningtechniques. J Ambient Intell Hum Comput 2(1):53\u201369. \nhttps:\/\/doi.org\/10.1007\/s12652-010-0038-7","journal-title":"J Ambient Intell Hum Comput"},{"key":"1480_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1999995.2000008","volume":"2011","author":"E Koukoumidis","year":"2011","unstructured":"Koukoumidis E, Peh L, SignalGuru Martonosi M (2011) Leveraging mobile phones for collaborative traffic signal schedule advisory. Proc ACM MobiSys 2011:27\u2013140. \nhttps:\/\/doi.org\/10.1145\/1999995.2000008","journal-title":"Proc ACM MobiSys"},{"key":"1480_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jnca.2015.04.010","volume":"55","author":"Y Lin","year":"2015","unstructured":"Lin Y, Wang X, Zhang L et al (2015) The impact of node velocity diversity on mobile opportunistic network performance. J Netw Comput Appl 55:47\u201358. \nhttps:\/\/doi.org\/10.1016\/j.jnca.2015.04.010","journal-title":"J Netw Comput Appl"},{"key":"1480_CR9","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.future.2018.01.007","volume":"82","author":"Y Lin","year":"2018","unstructured":"Lin Y, Wang X, Hao F et al (2018) An on-demand coverage based self-deployment algorithm for big data perception in mobile sensing networks. Future Gen Comput Syst 82:220\u2013234. \nhttps:\/\/doi.org\/10.1016\/j.future.2018.01.007","journal-title":"Future Gen Comput Syst"},{"key":"1480_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TVT.2019.2930667","volume":"1","author":"Y Lin","year":"2019","unstructured":"Lin Y, Cai Z, Wang X, Hao F (2019) Incentive mechanisms for crowdblocking rumors in mobile social networks. IEEE Trans Vehicular Technol 1:1\u201317. \nhttps:\/\/doi.org\/10.1109\/TVT.2019.2930667","journal-title":"IEEE Trans Vehicular Technol"},{"key":"1480_CR11","doi-asserted-by":"publisher","unstructured":"Mayer JM, Hiltz SR, Barkhuus L et al (2016) Supporting opportunities for context-aware social matching: an experience sampling. In: Study. conference on human factors in computing systems. ACM. \nhttps:\/\/doi.org\/10.1145\/2858036.2858175","DOI":"10.1145\/2858036.2858175"},{"key":"1480_CR12","doi-asserted-by":"publisher","unstructured":"Nguyen P, Nahrstedt K (2016) Context-aware crowd-sensing in opportunistic mobile social networks. In: IEEE, international conference on mobile ad hoc and sensor systems. IEEE, pp 477\u2013478. \nhttps:\/\/doi.org\/10.1109\/MASS.2015.80","DOI":"10.1109\/MASS.2015.80"},{"key":"1480_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/2307636.2307668","volume":"2012","author":"M Ra","year":"2012","unstructured":"Ra M, Liu B, Porta T, Medusa GR (2012) A programming framework for crowd-sensing applications. Proc ACM MobiSys 2012:337\u2013350. \nhttps:\/\/doi.org\/10.1145\/2307636.2307668","journal-title":"Proc ACM MobiSys"},{"key":"1480_CR14","doi-asserted-by":"publisher","unstructured":"Ristanovic N, Theodorakopoulos G, Le Boudec JY (2012) Traps and pitfalls of using contact traces in performance studies of opportunistic networks. NFOCOM, 2012 Proceedings IEEE. Ieee, pp 1377\u20131385. \nhttps:\/\/doi.org\/10.1109\/INFCOM.2012.6195502","DOI":"10.1109\/INFCOM.2012.6195502"},{"issue":"1","key":"1480_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MNET.2016.1500279NM","volume":"31","author":"Y-Y Shih","year":"2017","unstructured":"Shih Y-Y, Chung W-H, Chiu A-C, Wei H-Y (2017) Enabling low-latency applications in fog-radio access network. IEEE Netw 31(1):52\u201358. \nhttps:\/\/doi.org\/10.1109\/MNET.2016.1500279NM","journal-title":"IEEE Netw"},{"key":"1480_CR16","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.pmcj.2014.06.001","volume":"17","author":"E Talipov","year":"2015","unstructured":"Talipov E, Chon Y, Cha H (2015) User context-based data delivery in opportunistic smartphone networks. Pervasive Mob Comput 17:122\u2013138. \nhttps:\/\/doi.org\/10.1016\/j.pmcj.2014.06.001","journal-title":"Pervasive Mob Comput"},{"key":"1480_CR17","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/CCNC.2013.6488440","volume":"2013","author":"E Toledano","year":"2013","unstructured":"Toledano E, Sawaday D, Lippman A, Holtzman H, Casalegno F (2013) CoCam: a collaborative content sharing framework based on opportunistic P2P networking. Proc IEEE CCNC 2013:158\u2013163. \nhttps:\/\/doi.org\/10.1109\/CCNC.2013.6488440","journal-title":"Proc IEEE CCNC"},{"key":"1480_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.comcom.2013.12.003","volume":"41","author":"S Trifunovic","year":"2014","unstructured":"Trifunovic S, Kurant M, Hummel KA et al (2014) Preventing spam in opportunistic networks. Comput Commun 41:31\u201342. \nhttps:\/\/doi.org\/10.1016\/j.comcom.2013.12.003","journal-title":"Comput Commun"},{"key":"1480_CR19","doi-asserted-by":"publisher","unstructured":"Wang G, Wang B, Gao Y (2010) Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. In: Proceedings of the IEEE international conference on communications and mobile computing (CMC), vol 3, pp 452\u2013456. \nhttps:\/\/doi.org\/10.1109\/CMC.2010.83","DOI":"10.1109\/CMC.2010.83"},{"issue":"2","key":"1480_CR20","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s12083-016-0438-3","volume":"10","author":"X Wang","year":"2018","unstructured":"Wang X, Lin Y, Zhao Y (2018a) A novel approach for inhibiting misinformation propagation in human mobile opportunistic networks. Peer-to-Peer Netw Appl 10(2):377\u2013394. \nhttps:\/\/doi.org\/10.1007\/s12083-016-0438-3","journal-title":"Peer-to-Peer Netw Appl"},{"key":"1480_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/ett.3297","volume":"8","author":"R Wang","year":"2018","unstructured":"Wang R, Wang X, Hao F et al (2018b) Social identity- aware opportunistic routing in mobile social networks. Trans Emerg Telecommun Technol 8:1\u201312. \nhttps:\/\/doi.org\/10.1002\/ett.3297","journal-title":"Trans Emerg Telecommun Technol"},{"issue":"4","key":"1480_CR22","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s11277-016-3610-4","volume":"92","author":"J Wu","year":"2016","unstructured":"Wu J, Chen Z (2016) Reducing energy consumption and overhead based on mobile health in big data opportunistic networks. Wirel Pers Commun 92(4):1365\u20131385. \nhttps:\/\/doi.org\/10.1007\/s11277-016-3610-4","journal-title":"Wirel Pers Commun"},{"issue":"3","key":"1480_CR23","doi-asserted-by":"publisher","first-page":"3357","DOI":"10.1007\/s11277-017-4001-1","volume":"95","author":"J Wu","year":"2017","unstructured":"Wu J, Chen Z (2017) Human activity optimal cooperation objects selection routing scheme in opportunistic networks communication. Wirel Pers Commun 95(3):3357\u20133375. \nhttps:\/\/doi.org\/10.1007\/s11277-017-4001-1","journal-title":"Wirel Pers Commun"},{"key":"1480_CR24","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s12083-016-0526-4","volume":"11","author":"J Wu","year":"2018","unstructured":"Wu J, Chen Z (2018) Sensor communication area and node extend routing algorithm in opportunistic networks. Peer-to-Peer Netw Appl 11:90\u2013100. \nhttps:\/\/doi.org\/10.1007\/s12083-016-0526-4","journal-title":"Peer-to-Peer Netw Appl"},{"key":"1480_CR25","doi-asserted-by":"publisher","unstructured":"Wu XH, Gu XF, Poslad S (2016) Routing algorithm based on social relations in opportunistic networks. In: International computer conference on wavelet active media technology and information processing. IEEE, pp 146\u2013149. \nhttps:\/\/doi.org\/10.1109\/ICCWAMTIP.2015.7493963","DOI":"10.1109\/ICCWAMTIP.2015.7493963"},{"issue":"part 1","key":"1480_CR26","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.comnet.2017.10.005","volume":"129","author":"J Wu","year":"2017","unstructured":"Wu J, Chen J, Zhao M (2017) Effective information transmission based on socialization nodes in opportunistic networks. Comput Netw 129(part 1):297\u2013305. \nhttps:\/\/doi.org\/10.1016\/j.comnet.2017.10.005","journal-title":"Comput Netw"},{"key":"1480_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11227-018-2675-0","volume":"1","author":"J Wu","year":"2018","unstructured":"Wu J, Chen Z, Zhao M (2018a) SECM: status estimation and cache management algorithm in opportunistic networks. J Supercomput 1:1\u201312. \nhttps:\/\/doi.org\/10.1007\/s11227-018-2675-0","journal-title":"J Supercomput"},{"key":"1480_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-018-0649-x","author":"J Wu","year":"2018","unstructured":"Wu J, Chen Z, Zhao M (2018b) Weight distribution and community reconstitution based on communities communications in social opportunistic networks. Peer-to-Peer Netw Appl. \nhttps:\/\/doi.org\/10.1007\/s12083-018-0649-x","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"6","key":"1480_CR29","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 (2019a) Information cache management and data transmission algorithm in opportunistic social networks. Wirel Netw 25(6):2977\u20132988. \nhttps:\/\/doi.org\/10.1007\/s11276-018-1691-6","journal-title":"Wirel Netw"},{"key":"1480_CR30","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 (2019b) Hospital evaluation mechanism based on mobile health for IoT system in social networks. Comput Biol Med 109:138\u2013147. \nhttps:\/\/doi.org\/10.1016\/j.compbiomed.2019.04.021","journal-title":"Comput Biol Med"},{"issue":"1","key":"1480_CR31","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 (2019c) Interest characteristic probability predicted method in social opportunistic networks. IEEE Access 7(1):59002\u201359012. \nhttps:\/\/doi.org\/10.1109\/ACCESS.2019.2915359","journal-title":"IEEE Access"},{"issue":"1","key":"1480_CR32","doi-asserted-by":"publisher","first-page":"44851","DOI":"10.1109\/ACCESS.2019.2909538","volume":"7","author":"J Wu","year":"2019","unstructured":"Wu J, Guan P, Tan Y (2019d) Diagnosis and data probability decision based on Non-small cell lung cancer in medical system. IEEE Access 7(1):44851\u201344861. \nhttps:\/\/doi.org\/10.1109\/ACCESS.2019.2909538","journal-title":"IEEE Access"},{"key":"1480_CR33","doi-asserted-by":"publisher","unstructured":"Yuan P, Wang W, Wang C (2015) Poster: an adaptive copy spraying scheme for data forwarding in mobile opportunistic networks. In: Proceedings of the 16th ACM international symposium on mobile ad hoc networking and computing. ACM, pp 377\u2013378. \nhttps:\/\/doi.org\/10.1145\/2746285.2764862","DOI":"10.1145\/2746285.2764862"},{"issue":"2","key":"1480_CR34","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/tpds.2014.2308178","volume":"26","author":"D Zhao","year":"2015","unstructured":"Zhao D, Ma H, Tang S et al (2015) COUPON: a cooperative framework for building sensing maps in mobile opportunistic networks. IEEE Trans Parallel Distrib Syst 26(2):392\u2013402. \nhttps:\/\/doi.org\/10.1109\/tpds.2014.2308178","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01480-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-019-01480-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01480-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T17:50:57Z","timestamp":1599760257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-019-01480-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,11]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["1480"],"URL":"https:\/\/doi.org\/10.1007\/s12652-019-01480-2","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,11]]},"assertion":[{"value":"3 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no competing interests (all financial).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}