{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:08:23Z","timestamp":1778663303858,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T00:00:00Z","timestamp":1652832000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T00:00:00Z","timestamp":1652832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072159, U1804164, 61902112"],"award-info":[{"award-number":["62072159, U1804164, 61902112"]}],"id":[{"id":"10.13039\/501100001809","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,7]]},"DOI":"10.1007\/s12083-022-01331-6","type":"journal-article","created":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T11:02:55Z","timestamp":1652871775000},"page":"1953-1963","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["RAPAR: Routing algorithm based on node relationship mining in opportunistic network"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0023-1194","authenticated-orcid":false,"given":"Peiyan","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saike","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,18]]},"reference":[{"key":"1331_CR1","first-page":"975","volume":"178","author":"SM Ali","year":"2019","unstructured":"Ali SM, Sattar SA, Rao DS (2019) Wireless sensor networks routing design issues: a survey. Int J Comput Appl 178:975\u20138887","journal-title":"Int J Comput Appl"},{"issue":"4","key":"1331_CR2","doi-asserted-by":"publisher","first-page":"2214","DOI":"10.1109\/COMST.2015.2411335","volume":"17","author":"N Chakchouk","year":"2015","unstructured":"Chakchouk N (2015) A survey on opportunistic routing in wireless communication networks. IEEE Commun Surv Tutor 17(4):2214\u20132241","journal-title":"IEEE Commun Surv Tutor"},{"key":"1331_CR3","doi-asserted-by":"publisher","first-page":"2501","DOI":"10.1016\/j.procs.2020.04.271","volume":"171","author":"S Singha","year":"2020","unstructured":"Singha S et al (2020) A survey to analyse routing algorithms for opportunistic network. Proc Comput Sci 171:2501\u20132511","journal-title":"Proc Comput Sci"},{"issue":"4","key":"1331_CR4","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1007\/s10922-020-09551-y","volume":"28","author":"P Bellavista","year":"2020","unstructured":"Bellavista P et al (2020) SDN-based traffic management middleware for spontaneous WMNs. J Netw Syst Manage 28(4):1575\u20131609","journal-title":"J Netw Syst Manage"},{"issue":"2","key":"1331_CR5","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1109\/TVT.2015.2401605","volume":"65","author":"S Wang","year":"2015","unstructured":"Wang S et al (2015) The potential of mobile opportunistic networks for data disseminations. IEEE Trans Vehicular Technol 65(2):912\u2013922","journal-title":"IEEE Trans Vehicular Technol"},{"issue":"3","key":"1331_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s13278-012-0073-9","volume":"3","author":"D Popovici","year":"2013","unstructured":"Popovici D et al (2013) A framework for mobile and context-aware applications applied to vehicular social networks. Soc Netw Anal Min 3(3):329\u2013340","journal-title":"Soc Netw Anal Min"},{"key":"1331_CR7","doi-asserted-by":"crossref","unstructured":"Juang P et al (2002) Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems","DOI":"10.1145\/605397.605408"},{"key":"1331_CR8","doi-asserted-by":"crossref","unstructured":"Zhao W, Ammar M, Zegura E (2004) A message ferrying approach for data delivery in sparse mobile ad hoc networks. Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing","DOI":"10.1145\/989459.989483"},{"issue":"2","key":"1331_CR9","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/SURV.2012.062612.00134","volume":"15","author":"J Mukherjee","year":"2012","unstructured":"Mukherjee J, Ramamurthy B (2012) Communication technologies and architectures for space network and interplanetary internet. IEEE Commun Surv Tutor 15(2):881\u2013897","journal-title":"IEEE Commun Surv Tutor"},{"key":"1331_CR10","doi-asserted-by":"crossref","unstructured":"Wang Y et al (2021) Lifesaving with RescueChain: Energy-efficient and partition-tolerant blockchain based secure information sharing for UAV-aided disaster rescue. IEEE INFOCOM 2021-IEEE Conference on Computer Communications, IEEE","DOI":"10.1109\/INFOCOM42981.2021.9488719"},{"key":"1331_CR11","unstructured":"Vahdat A, Becker\u00a0D (2000) Epidemic routing for partially connected ad hoc networks"},{"issue":"10","key":"1331_CR12","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1002\/wcm.519","volume":"7","author":"Y Wang","year":"2007","unstructured":"Wang Y, Dang H, Hongyi W (2007) A survey on analytic studies of delay? Tolerant mobile sensor networks. Wirel Commun Mob Comput 7(10):1197\u20131208","journal-title":"Wirel Commun Mob Comput"},{"key":"1331_CR13","unstructured":"Chen K, Shen\u00a0H (2012) SMART: Lightweight distributed social map based routing in delay tolerant networks. 2012 20th IEEE International Conference on Network Protocols (ICNP), IEEE"},{"issue":"3","key":"1331_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A Lindgren","year":"2003","unstructured":"Lindgren A, Doria A, Schelen O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob Comput Commun Rev 7(3):19\u201320","journal-title":"ACM SIGMOBILE Mob Comput Commun Rev"},{"key":"1331_CR15","doi-asserted-by":"crossref","unstructured":"Wang X et al (2015) Probabilistic routing based on two-hop information in delay\/disruption tolerant networks. J Electric Comput Eng\u00a02015","DOI":"10.1155\/2015\/918065"},{"issue":"16","key":"1331_CR16","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1002\/dac.3030","volume":"29","author":"C Yu","year":"2016","unstructured":"Yu C et al (2016) Probabilistic routing algorithm based on contact duration and message redundancy in delay tolerant network. Int J Commun Syst 29(16):2416\u20132426","journal-title":"Int J Commun Syst"},{"key":"1331_CR17","doi-asserted-by":"crossref","unstructured":"Mtibaa A et al (2010) Peoplerank: Social opportunistic forwarding. 2010 Proceedings IEEE INFOCOM, IEEE","DOI":"10.1109\/INFCOM.2010.5462261"},{"issue":"1-7","key":"1331_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"issue":"11","key":"1331_CR19","doi-asserted-by":"publisher","first-page":"1576","DOI":"10.1109\/TMC.2010.246","volume":"10","author":"P Hui","year":"2010","unstructured":"Hui P, Crowcroft J, Yoneki E (2010) Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Trans Mob Comput 10(11):1576\u20131589","journal-title":"IEEE Trans Mob Comput"},{"issue":"6","key":"1331_CR20","doi-asserted-by":"publisher","first-page":"3997","DOI":"10.1007\/s11276-020-02288-1","volume":"26","author":"MM Qirtas","year":"2020","unstructured":"Qirtas MM, Faheem Y, Rehmani MH (2020) A cooperative mobile throwbox-based routing protocol for social-aware delay tolerant networks. Wirel Netw 26(6):3997\u20134009","journal-title":"Wirel Netw"},{"issue":"5","key":"1331_CR21","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/17517575.2015.1067840","volume":"11","author":"X Wang","year":"2017","unstructured":"Wang X et al (2017) A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters. Enterp Inf Syst 11(5):597\u2013626","journal-title":"Enterp Inf Syst"},{"issue":"7","key":"1331_CR22","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1109\/TC.2013.55","volume":"63","author":"Mingjun Xiao","year":"2013","unstructured":"Xiao M, Wu J, Huang L (2013) Community-aware opportunistic routing in mobile social networks. IEEE Trans Comput 63(7):1682\u20131695","journal-title":"IEEE Trans Comput"},{"key":"1331_CR23","doi-asserted-by":"crossref","unstructured":"Dhurandher SK et al (2016) EDR: an encounter and distance based routing protocol for opportunistic networks. 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA), IEEE","DOI":"10.1109\/AINA.2016.15"},{"issue":"3","key":"1331_CR24","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1109\/JSYST.2016.2630923","volume":"12","author":"DK Sharma","year":"2016","unstructured":"Sharma DK et al (2016) A machine learning-based protocol for efficient routing in opportunistic networks. IEEE Syst J 12(3):2207\u20132213","journal-title":"IEEE Syst J"},{"key":"1331_CR25","doi-asserted-by":"crossref","unstructured":"Ying Z et al (2015) Geo-social: Routing with location and social metrics in mobile opportunistic networks. 2015 IEEE International Conference on Communications (ICC), IEEE","DOI":"10.1109\/ICC.2015.7248851"},{"key":"1331_CR26","doi-asserted-by":"crossref","unstructured":"Yuan P, Song M (2018) MONICA: One simulator for mobile opportunistic networks. 11th EAI International Conference on Mobile Multimedia Communications. European Alliance for Innovation (EAI)","DOI":"10.4108\/eai.21-6-2018.2276563"},{"issue":"3","key":"1331_CR27","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1109\/TNET.2011.2120618","volume":"19","author":"I Rhee","year":"2011","unstructured":"Rhee I et al (2011) On the levy-walk nature of human mobility. IEEE\/ACM Trans Netw 19(3):630\u2013643","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1331_CR28","unstructured":"Mi C, Xu R, Lin CT (2019) Real-time recognition of smartphone user behavior based on prophet algorithms. arXiv preprint:\u00a0arXiv:1909.08997"},{"key":"1331_CR29","doi-asserted-by":"crossref","unstructured":"Yuan A, Calder J, Osting\u00a0B (2021) A continuum limit for the PageRank algorithm. Eur J Appl Math 1\u201333","DOI":"10.1017\/S0956792521000097"},{"issue":"3","key":"1331_CR30","first-page":"688","volume":"38","author":"N Xueli","year":"2018","unstructured":"Xueli N et al (2018) Frequent location privacy-preserving algorithm based on geosocial network. J Comput App 38(3):688","journal-title":"J Comput App"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-022-01331-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-022-01331-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-022-01331-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T12:31:05Z","timestamp":1656765065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-022-01331-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,18]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1331"],"URL":"https:\/\/doi.org\/10.1007\/s12083-022-01331-6","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,18]]},"assertion":[{"value":"27 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}