{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:41:54Z","timestamp":1740102114671,"version":"3.37.3"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102224"],"award-info":[{"award-number":["62102224"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1109\/iscc58397.2023.10218195","type":"proceedings-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T17:46:48Z","timestamp":1693244808000},"page":"810-815","source":"Crossref","is-referenced-by-count":0,"title":["SCON: A Secure Cooperative Framework Against Gossip Dissemination in Opportunistic Network"],"prefix":"10.1109","author":[{"given":"Jinlong","family":"E","sequence":"first","affiliation":[{"name":"School of Information, Renmin University of China,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaokun","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Intelligence and Computing, Tianjin University,Tianjin,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2011","author":"symington","key":"ref13"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2018.00038"},{"key":"ref15","first-page":"81","article-title":"Exploiting a natural network effect for scalable, fine-grained clock synchronization","author":"geng","year":"0","journal-title":"Proc of USENIX NSDI"},{"journal-title":"FireChat","year":"0","key":"ref14"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IMCCC.2015.299"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-021-08829-x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3115160"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2016.7733002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2632951.2632979"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2011.06.004"},{"key":"ref19","article-title":"The one simulator for dtn protocol evalution","author":"keranen","year":"0","journal-title":"Proc ICS"},{"journal-title":"Approximation Algorithms for NP-Hard Problems","year":"1996","author":"hochbaum","key":"ref18"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45855.2022.9838475"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS54207.2022.9789826"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2149552"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-019-01480-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149039"},{"key":"ref21","first-page":"119:1","article-title":"An opportunistic network routing algorithm basedon cosine similarity of data packets between nodes","author":"lin","year":"2018","journal-title":"Algorithms"},{"key":"ref8","first-page":"1","article-title":"Maxprop:routing for vehicle-based disruption-tolerant networks","author":"burgess","year":"0","journal-title":"Proc of IEEE INFO-COM"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2009.02.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.2000189"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICST46873.2019.9047671"},{"journal-title":"Epidemic Routing for Partially Connected Ad Hoc Networks","year":"2000","author":"vahdat","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid51090.2021.00092"}],"event":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2023,7,9]]},"location":"Gammarth, Tunisia","end":{"date-parts":[[2023,7,12]]}},"container-title":["2023 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10217219\/10217829\/10218195.pdf?arnumber=10218195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:39:39Z","timestamp":1695058779000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10218195\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,9]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/iscc58397.2023.10218195","relation":{},"subject":[],"published":{"date-parts":[[2023,7,9]]}}}