{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:50:52Z","timestamp":1761648652450,"version":"3.37.3"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1804164","U1404602"],"award-info":[{"award-number":["U1804164","U1404602"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Foundation of Henan Province","award":["172102210341"],"award-info":[{"award-number":["172102210341"]}]},{"name":"Science and Technology Foundation of Henan Educational Committee","award":["19A510015"],"award-info":[{"award-number":["19A510015"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2908920","type":"journal-article","created":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T18:59:37Z","timestamp":1554231577000},"page":"44840-44850","source":"Crossref","is-referenced-by-count":12,"title":["SSR: Using the Social Similarity to Improve the Data Forwarding Performance in Mobile Opportunistic Networks"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0023-1194","authenticated-orcid":false,"given":"Peiyan","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Xiaoxiao","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Mingyang","family":"Song","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.4108\/eai.21-6-2018.2276563"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74048-3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347153"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2014.2346080"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2120618"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6654792"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7036832"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.01.006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2009.2031454"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2831247"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2740218"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/17517575.2015.1067840"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248851"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.246"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462261"},{"key":"ref28","first-page":"359","article-title":"Using dynamic time warping to find patterns in time series","author":"berndt","year":"1994","journal-title":"Proc KDD Workshop"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848053"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57301-1_5"},{"article-title":"Epidemic routing for partially-connected ad hoc networks","year":"2000","author":"vahdat","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.299"},{"key":"ref29","first-page":"201","article-title":"Efficient retrieval of similar time sequences under time warping","author":"yi","year":"2002","journal-title":"Proc 14th Int Conf Data Eng"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-015-1048-3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935076"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288113"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062233"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2014.06.003"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.69"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.229"},{"key":"ref21","first-page":"146","article-title":"Routing algorithm based on social relations in opportunistic networks","author":"wu","year":"2016","journal-title":"Proc 12th Int Comput Conf Wavelet Active Media Technol Inf Process"},{"key":"ref24","first-page":"1","article-title":"Smart: Lightweight distributed social map based routing in delay tolerant networks","author":"chen","year":"2012","journal-title":"Proc 20th IEEE Int Conf Netw Protocols"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1060"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-016-0526-4"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08679992.pdf?arnumber=8679992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:41Z","timestamp":1628624441000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8679992\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2908920","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}