{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:41:37Z","timestamp":1740148897246,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T00:00:00Z","timestamp":1670025600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T00:00:00Z","timestamp":1670025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE25-0005-02"],"award-info":[{"award-number":["ANR-16-CE25-0005-02"]}],"id":[{"id":"10.13039\/501100001665","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":[[2023,1]]},"DOI":"10.1007\/s12083-022-01404-6","type":"journal-article","created":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T02:02:23Z","timestamp":1670032943000},"page":"395-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Supporting conflict-free replicated data types in opportunistic networks"],"prefix":"10.1007","volume":"16","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Guidec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9302-1497","authenticated-orcid":false,"given":"Yves","family":"Mah\u00e9o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camille","family":"No\u00fbs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,3]]},"reference":[{"key":"1404_CR1","doi-asserted-by":"publisher","unstructured":"Dragojevi\u0107 A, Narayanan D, Nightingale EB et al (2015) No Compromises: Distributed Transactions with Consistency, Availability, and Performance. In: 25th Symposium on Operating Systems Principles (SOSP\u201915), Copper Mountain Resort, CO, USA. ACM, pp 54\u201370. https:\/\/doi.org\/10.1145\/2815400.2815425","DOI":"10.1145\/2815400.2815425"},{"key":"1404_CR2","doi-asserted-by":"crossref","unstructured":"Moniz H, Leit\u00e3o J, Dias RJ et al (2017) Blotter: Low Latency Transactions for Geo-Replicated Storage. In: 26th International Conference on World Wide Web (WWW\u201917), Perth, WA, Australia. ACM. https:\/\/doi.org\/10.1145\/3038912.3052603","DOI":"10.1145\/3038912.3052603"},{"key":"1404_CR3","doi-asserted-by":"crossref","unstructured":"Pregui\u00e7a N (2018) Conflict-free Replicated Data Types: an Overview. Arxiv Preprint. https:\/\/arxiv.org\/abs\/1806.10254","DOI":"10.1007\/978-3-319-63962-8_185-1"},{"key":"1404_CR4","unstructured":"Shapiro M, Pregui\u00e7a N, Baquero C et al (2011) A Comprehensive Study of Convergent and Commutative Replicated Data Types. Tech. Rep. 7506, INRIA"},{"key":"1404_CR5","doi-asserted-by":"crossref","unstructured":"Almeida PS, Shoker A, Baquero C (2015) Efficient State-Based CRDTs by Delta-Mutation. In: International Conference on Networked Systems (NETYS 2015), Agadir, Morroco. Springer, pp 62\u201376. https:\/\/doi.org\/10.1007\/978-3-319-26850-75","DOI":"10.1007\/978-3-319-26850-7_5"},{"key":"1404_CR6","doi-asserted-by":"crossref","unstructured":"vander Linde A, Leit\u00e3o J, Pregui\u00e7a N (2016) $$Delta$$-CRDTs: Making $$delta$$-CRDTs Delta-based. In: 2nd Workshop on the Principles and Practice of Consistency for Distributed Data (PaPoC 2016), London, United Kingdom. ACM. https:\/\/doi.org\/10.1145\/2911151.2911163","DOI":"10.1145\/2911151.2911163"},{"issue":"11","key":"1404_CR7","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/MCOM.2006.248176","volume":"44","author":"L Pelusi","year":"2006","unstructured":"Pelusi L, Passarella A, Conti M (2006) Opportunistic Networking: Data Forwarding in Disconnected Mobile Ad Hoc Networks. IEEE Commun Mag 44(11):134\u2013141. https:\/\/doi.org\/10.1109\/MCOM.2006.248176","journal-title":"IEEE Commun Mag"},{"key":"1404_CR8","unstructured":"Scott J, Gass R, Crowcroft J et al (2009) CRAWDAD Dataset cambridge\/haggle (v. 2009-05-29). CRAWDAD Wireless Network Data Archive. https:\/\/crawdad.org\/cambridge\/haggle\/20090529\/imote"},{"issue":"9","key":"1404_CR9","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/MCOM.2010.5560597","volume":"48","author":"M Conti","year":"2010","unstructured":"Conti M, Giordano S, May M et al (2010) From Opportunistic Networks to Opportunistic Computing. IEEE Commun Mag 48(9):126\u2013139. https:\/\/doi.org\/10.1109\/MCOM.2010.5560597","journal-title":"IEEE Commun Mag"},{"key":"1404_CR10","doi-asserted-by":"crossref","unstructured":"Costea M, Ciobanu RI, Marin RC et al (2016) Causal and Total Order in Opportunistic Networks, IGI Global, chap Emerging Innovations in Wireless Networks and Broadband Technologies, pp 221\u2013262. https:\/\/doi.org\/10.4018\/978-1-4666-9941-0.ch010","DOI":"10.4018\/978-1-4666-9941-0.ch010"},{"key":"1404_CR11","doi-asserted-by":"publisher","unstructured":"Costea M, Ciobanu RI, Marin RC et al (2017) Total Order in Opportunistic Networks. Concurrency and Computation: Practice and Experience 29(10). https:\/\/doi.org\/10.1002\/cpe.4056","DOI":"10.1002\/cpe.4056"},{"key":"1404_CR12","doi-asserted-by":"publisher","unstructured":"Weiss S, Urso P, Molli P (2009) Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks. In: 29th International Conference on Distributed Computing Systems (ICDCS\u201909), Montreal, Canada. IEEE, pp 404\u2013412. https:\/\/doi.org\/10.1109\/ICDCS.2009.75","DOI":"10.1109\/ICDCS.2009.75"},{"key":"1404_CR13","unstructured":"Vahdat A, Becker D (2000) Epidemic Routing for Partially Connected Ad Hoc Networks. Tech. Rep. CS-200006, Duke University, Durham, USA"},{"key":"1404_CR14","doi-asserted-by":"crossref","unstructured":"Ciobanu RI, Marin RC, Dobre C, et al (2014) ONSIDE: Socially-aware and Interest-based Dissemination in Opportunistic Networks. In: Network Operations and Management Symposium (NOMS), Krakow, Poland. IEEE. https:\/\/doi.org\/10.1109\/NOMS.2014.6838390","DOI":"10.1109\/NOMS.2014.6838390"},{"key":"1404_CR15","doi-asserted-by":"publisher","unstructured":"Robin CEA, Romero VM (2018) DTNDocs: A Delay Tolerant Peer-to-Peer Collaborative Editing System. In: 32nd International Conference on Information Networking (ICOIN), Chiang Mai, Thailand, pp 92\u201397. https:\/\/doi.org\/10.1109\/ICOIN.2018.8343092","DOI":"10.1109\/ICOIN.2018.8343092"},{"key":"1404_CR16","first-page":"1","volume":"37","author":"S Schildt","year":"2011","unstructured":"Schildt S, Morgenroth J, P\u00f6ttner WB et al (2011) IBR-DTN: A Lightweight, Modular and Highly Portable Bundle Protocol Implementation. Electronic Communications of the EASST 37:1\u201311","journal-title":"Electronic Communications of the EASST"},{"key":"1404_CR17","doi-asserted-by":"publisher","unstructured":"Li T, Kouyoumdjieva ST, Karlsson G et al (2019) Data Collection and Node Counting by Opportunistic Communication. In: IFIP Networking Conference (Networking 2019), Warsaw, Poland. IEEE, pp 1\u20139. https:\/\/doi.org\/10.23919\/IFIPNetworking.2019.8816851","DOI":"10.23919\/IFIPNetworking.2019.8816851"},{"key":"1404_CR18","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.jpdc.2017.08.003","volume":"111","author":"PS Almeida","year":"2018","unstructured":"Almeida PS, Shoker A, Baquero C (2018) Delta State Replicated Data Types. Journal of Parallel and Distributed Computing 111:162\u2013173. https:\/\/doi.org\/10.1016\/j.jpdc.2017.08.003","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1404_CR19","doi-asserted-by":"publisher","unstructured":"Enes V, Almeida PS, Baquero C et al (2019) Efficient Synchronization of State-Based CRDTs. In: 35th International Conference on Data Engineering (ICDE\u201919), Paris, France. IEEE, pp 148\u2013159. https:\/\/doi.org\/10.1109\/ICDE.2019.00022","DOI":"10.1109\/ICDE.2019.00022"},{"key":"1404_CR20","doi-asserted-by":"publisher","unstructured":"Brocco A (2021) The Document Chain: a Delta CRDT Framework for Arbitrary JSON Data. In: 29th Italian Symposium on Advanced Database Systems (SEBD21), Pizzo Calabro (VV), Italy, vol 2994. CEUR Workshop Proceedings. https:\/\/doi.org\/10.1109\/ICTA.2017.8336061","DOI":"10.1109\/ICTA.2017.8336061"},{"key":"1404_CR21","doi-asserted-by":"publisher","unstructured":"Rinberg A, Solomon T, Shlomo R et al (2022) DSON: JSON CRDT Using Delta-Mutations for Document Stores. Proceedings of the VLDB Endowment 15(5):1053\u20131065. https:\/\/doi.org\/10.14778\/3510397.3510403","DOI":"10.14778\/3510397.3510403"},{"key":"1404_CR22","doi-asserted-by":"publisher","unstructured":"Nicolaescu P, Jahns K, Derntl M, etal (2016) Near Real-Time Peer-to-Peer Shared Editing on Extensible Data Types. In: 19th International Conference on Supporting Group Work (GROUP\u201916), Sanibel Island, FL, USA. ACM, pp 39\u201349. https:\/\/doi.org\/10.1145\/2957276.2957310","DOI":"10.1145\/2957276.2957310"},{"key":"1404_CR23","doi-asserted-by":"publisher","unstructured":"Datta A, Quarteroni S, Aberer K (2004) Autonomous Gossiping: a Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Mobile Ad-Hoc Networks. In: 1st International Conference on Semantics of a Networked World (ICSNW\u201904). Springer, Paris, France, no. 3226 in LNCS, pp 126\u2013143 https:\/\/doi.org\/10.1007\/978-3-540-30145-58","DOI":"10.1007\/978-3-540-30145-58"},{"key":"1404_CR24","unstructured":"Fall K (2004) Messaging in Difficult Environments. Tech. Rep. IRB-TR-04-019. Intel Research Berkeley"},{"key":"1404_CR25","doi-asserted-by":"publisher","unstructured":"Guidec F, Launay P, Mah\u00e9o Y (2021a) Causal and $$Delta$$-Causal Broadcast in Opportunistic Networks. Future Generation Computer Systems 118:142\u2013156. https:\/\/doi.org\/10.1016\/j.future.2020.12.024","DOI":"10.1016\/j.future.2020.12.024"},{"key":"1404_CR26","doi-asserted-by":"publisher","unstructured":"Enes V, Baquero C, Almeida PS etal (2016) Join Decompositions for Efficient Synchronization of CRDTs after a Network Partition: Work in Progress Report. In: 1st Workshop on Programming Models and Languages for Distributed Computing (PMLDC\u201916), Rome, Italy. https:\/\/doi.org\/10.1145\/2957319.2957374","DOI":"10.1145\/2957319.2957374"},{"key":"1404_CR27","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.jss.2018.04.025","volume":"142","author":"A S\u00e1nchez-Carmona","year":"2018","unstructured":"S\u00e1nchez-Carmona A, Guidec F, Launay P et al (2018) Filling in the Missing Link between Simulation and Application in Opportunistic Networking. J Syst Softw 142:57\u201372. https:\/\/doi.org\/10.1016\/j.jss.2018.04.025","journal-title":"J Syst Softw"},{"key":"1404_CR28","doi-asserted-by":"publisher","unstructured":"Casteigts A, Chaumette S, Ferreira A (2010) Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. In: Structural Information and Communication Complexity (SIROCCO 2010), Sirince, Turkey, LNCS, vol 5869. Springer, pp 126\u2013140. https:\/\/doi.org\/10.1007\/978-3-642-11476-211","DOI":"10.1007\/978-3-642-11476-211"},{"key":"1404_CR29","doi-asserted-by":"publisher","unstructured":"Ker\u00e4nen A, Ott J, K\u00e4rkk\u00e4inen T (2009) The ONE Simulator for DTN Protocol Evaluation. In: 2nd International Conference on Simulation Tools and Techniques (SIMUTools\u201909), Rome, Italy. ICST. https:\/\/doi.org\/10.4108\/ICST.SIMUTOOLS2009.5674","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"issue":"5","key":"1404_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts A, Flocchini P, Santoro N et al (2012) Time-Varying Graphs and Dynamic Networks. Int J Parallel Emergent Distrib Syst 27(5):387\u2013408. https:\/\/doi.org\/10.1080\/17445760.2012.668546","journal-title":"Int J Parallel Emergent Distrib Syst"},{"key":"1404_CR31","unstructured":"Benbadis F, Leguay J (2009) CRAWDAD Dataset upmc\/rollernet (v. 2009-02-02). CRAWDAD Wireless Network Data Archive. https:\/\/crawdad.org\/upmc\/rollernet\/20090202"},{"key":"1404_CR32","unstructured":"Guidec F, Launay P, Mah\u00e9o Y (2021b) CRAWDAD Dataset ubs\/vbn (v. 2021-12-16). CRAWDAD Wireless Network Data Archive. https:\/\/crawdad.org\/ubs\/vbn\/2021-12-16\/vbn_200"},{"key":"1404_CR33","first-page":"1","volume-title":"4th Extreme Conference on Communication (ExtremeCom\u201912)","author":"Y Mah\u00e9o","year":"2012","unstructured":"Mah\u00e9o Y, Le Sommer N, Launay P et al (2012) Beyond Opportunistic Networking Protocols: a Disruption-Tolerant Application Suite for Disconnected MANETs. 4th Extreme Conference on Communication (ExtremeCom\u201912). ACM, Z\u00fcrich, Switzerland, pp 1\u20136"},{"key":"1404_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.comnet.2015.05.017","volume":"87","author":"C Borrego","year":"2015","unstructured":"Borrego C, Robles S, Fabregues A et al (2015) A Mobile Code Bundle Extension for Application-Defined Routing in Delay and Disruption Tolerant Networking. Comput Netw 87:59\u201377. https:\/\/doi.org\/10.1016\/j.comnet.2015.05.017","journal-title":"Comput Netw"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-022-01404-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-022-01404-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-01404-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T05:00:30Z","timestamp":1679374830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-022-01404-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1404"],"URL":"https:\/\/doi.org\/10.1007\/s12083-022-01404-6","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"type":"print","value":"1936-6442"},{"type":"electronic","value":"1936-6450"}],"subject":[],"published":{"date-parts":[[2022,12,3]]},"assertion":[{"value":"21 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 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 have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}