{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:14:12Z","timestamp":1740158052468,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T00:00:00Z","timestamp":1563148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T00:00:00Z","timestamp":1563148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministry of Science, Innovation and Universities","doi-asserted-by":"publisher","award":["RTI2018-095094-B-C22","TIN2014-57364- C2-2-R"],"award-info":[{"award-number":["RTI2018-095094-B-C22","TIN2014-57364- C2-2-R"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad, Gobierno de Espa\u00f1a","doi-asserted-by":"publisher","award":["TIN2017- 87211-R"],"award-info":[{"award-number":["TIN2017- 87211-R"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"publisher"}]},{"name":"China Student Council","award":["201606140138"],"award-info":[{"award-number":["201606140138"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s12652-019-01393-0","type":"journal-article","created":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T09:06:01Z","timestamp":1563181561000},"page":"15059-15072","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Message anonymity on predictable opportunistic networks"],"prefix":"10.1007","volume":"14","author":[{"given":"D.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Navarro-Arribas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"P\u00e9rez-Sol\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Borrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,15]]},"reference":[{"key":"1393_CR1","doi-asserted-by":"crossref","unstructured":"Antunez-Veas A, Navarro-Arribas G (2016) Onion routing in deterministic delay tolerant networks. In: Foundations and practice of security. Springer, Berlin, pp 303\u2013310 (no. 9482 in Lecture Notes in Computer Science)","DOI":"10.1007\/978-3-319-30303-1_21"},{"issue":"3","key":"1393_CR2","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s12652-017-0462-z","volume":"9","author":"SJ Borah","year":"2018","unstructured":"Borah SJ, Dhurandher SK, Woungang I, Kumar V, Barolli L (2018) A multi-objectives based technique for optimized routing in opportunistic networks. J Ambient Intell Hum Comput 9(3):655\u2013666","journal-title":"J Ambient Intell Hum Comput"},{"key":"1393_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.adhoc.2019.01.001","volume":"88","author":"C Borrego","year":"2019","unstructured":"Borrego C, Borrell J, Robles S (2019) Efficient broadcast in opportunistic networks using optimal stopping theory. Ad Hoc Networks 88:5\u201317. https:\/\/doi.org\/10.1016\/j.adhoc.2019.01.001","journal-title":"Ad Hoc Networks"},{"issue":"5","key":"1393_CR4","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, Quattrociocchi W, Santoro N (2012) Time-varying graphs and dynamic networks. Int J Parallel Emerg Distrib Syst 27(5):387\u2013408","journal-title":"Int J Parallel Emerg Distrib Syst"},{"key":"1393_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.cose.2013.03.003","volume":"37","author":"S Castillo-Perez","year":"2013","unstructured":"Castillo-Perez S, Garcia-Alfaro J (2013) Onion routing circuit construction via latency graphs. Comput Secur 37:197\u2013214. https:\/\/doi.org\/10.1016\/j.cose.2013.03.003","journal-title":"Comput Secur"},{"key":"1393_CR6","doi-asserted-by":"publisher","unstructured":"Chen D, Navarro-Arribas G, Borrell J (2017) On the applicability of onion routing on predictable delay-tolerant networks. In: 2017 IEEE 42nd conference on local computer networks (LCN), pp 575\u2013578. https:\/\/doi.org\/10.1109\/LCN.2017.17","DOI":"10.1109\/LCN.2017.17"},{"key":"1393_CR7","first-page":"54","volume-title":"Towards measuring anonymity. Privacy enhancing technologies","author":"C Diaz","year":"2002","unstructured":"Diaz C, Seys S, Claessens J, Preneel B (2002) Towards measuring anonymity. Privacy enhancing technologies. Springer, Berlin, Heidelberg, pp 54\u201368 (Lecture Notes in Computer Science)"},{"issue":"6","key":"1393_CR8","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1109\/TMC.2014.2345392","volume":"14","author":"L Fan","year":"2015","unstructured":"Fan L, Minsu H, Zhiyuan Y, Chao Z, Wang Y (2015) Reliable topology design in time-evolving delay-tolerant networks with unreliable links. IEEE Trans Mob Comput 14(6):1301\u20131314","journal-title":"IEEE Trans Mob Comput"},{"key":"1393_CR9","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.adhoc.2014.07.006","volume":"25","author":"J Fraire","year":"2015","unstructured":"Fraire J, Finochietto JM (2015) Routing-aware fair contact plan design for predictable delay tolerant networks. Ad Hoc Netw 25:303\u2013313","journal-title":"Ad Hoc Netw"},{"key":"1393_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-61996-8_37","volume-title":"Information hiding. IH 1996","author":"DM Goldschlag","year":"1996","unstructured":"Goldschlag DM, Reed MG, Syverson PF (1996) Hiding routing information. In: Anderson R (eds) Information hiding. IH 1996. Lecture notes in computer science, vol 1174. Springer, Berlin, pp 137\u2013150"},{"issue":"3","key":"1393_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125","journal-title":"Phys Rep"},{"key":"1393_CR13","doi-asserted-by":"publisher","unstructured":"Huang M, Chen S, Fan L, Yu W (2015) Topology design in time-evolving delay-tolerant networks with unreliable links. In: 2012 IEEE global communications conference (GLOBECOM), Anaheim, CA, 2012, pp 5296\u20135301. https:\/\/doi.org\/10.1109\/GLOCOM.2012.6503962","DOI":"10.1109\/GLOCOM.2012.6503962"},{"key":"1393_CR14","doi-asserted-by":"publisher","unstructured":"Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. In: Proceedings of the 2004 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM '04). ACM, New York, NY, USA, pp 145\u2013158. https:\/\/doi.org\/10.1145\/1015467.1015484","DOI":"10.1145\/1015467.1015484"},{"key":"1393_CR15","unstructured":"Jetcheva JG, Hu YC, PalChaudhuri S, Saha AK, Johnson DB (2003) CRAWDAD dataset rice\/ad\\_hoc\\_city (v. 2003-09-11). https:\/\/crawdad.org\/rice\/ad_hoc_city\/20030911. 10.15783\/C73K5B"},{"key":"1393_CR16","doi-asserted-by":"crossref","unstructured":"Kate A, Zaverucha GM, Hengartner U (2007) Anonymity and security in delay tolerant networks. In: Third international conference on security and privacy in communications networks and the workshops, 2007. SecureComm 2007, IEEE, pp 504\u2013513","DOI":"10.1109\/SECCOM.2007.4550373"},{"issue":"6","key":"1393_CR17","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos V (2009) Temporal graphs. Phys A Stat Mech Appl 388(6):1007\u20131023","journal-title":"Phys A Stat Mech Appl"},{"issue":"11","key":"1393_CR18","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/j.comnet.2010.03.002","volume":"54","author":"X Lu","year":"2010","unstructured":"Lu X, Hui P, Towsley D, Pu J, Xiong Z (2010) Anti-localization anonymous routing for delay tolerant network. Comput Netw 54(11):1099\u20131910","journal-title":"Comput Netw"},{"issue":"1","key":"1393_CR19","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217302","volume":"1","author":"A Machanavajjhala","year":"2007","unstructured":"Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M (2007) L-diversity: privacy beyond k-anonymity. ACM Trans Knowl Discov Data 1(1):3. https:\/\/doi.org\/10.1145\/1217299.1217302","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1393_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.comcom.2014.03.019","volume":"48","author":"VF Mota","year":"2014","unstructured":"Mota VF, Cunha FD, Macedo DF, Nogueira JM, Loureiro AA (2014) Protocols, mobility models and tools in opportunistic networks: a survey. Comput Commun 48:5\u201319. https:\/\/doi.org\/10.1016\/j.comcom.2014.03.019","journal-title":"Comput Commun"},{"issue":"1","key":"1393_CR21","doi-asserted-by":"publisher","first-page":"016105(10)","DOI":"10.1103\/PhysRevE.84.016105","volume":"84","author":"RK Pan","year":"2011","unstructured":"Pan RK, Saram\u00e4ki J (2011) Path lengths, correlations, and centrality in temporal networks. Phys Rev E 84(1):016105(10)","journal-title":"Phys Rev E"},{"issue":"8","key":"1393_CR22","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/TCS.1978.1084515","volume":"25","author":"F Rubin","year":"1978","unstructured":"Rubin F (1978) Enumerating all simple paths in a graph. IEEE Trans Circ Syst 25(8):641\u2013642. https:\/\/doi.org\/10.1109\/TCS.1978.1084515","journal-title":"IEEE Trans Circ Syst"},{"key":"1393_CR23","doi-asserted-by":"crossref","unstructured":"Sakai K, Sun MT, Ku WS, Wu J, Alanazi FS (2016) An analysis of onion-based anonymous routing for delay tolerant networks. In: 2016 IEEE 36th international conference on distributed computing systems (ICDCS), IEEE, pp 609\u2013618","DOI":"10.1109\/ICDCS.2016.9"},{"issue":"6","key":"1393_CR24","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P Samarati","year":"2001","unstructured":"Samarati P (2001) Protecting respondents identities in microdata release. IEEE Trans Knowl Data Eng 13(6):1010\u20131027. https:\/\/doi.org\/10.1109\/69.971193","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1393_CR25","unstructured":"Scott K, Burleigh S (2007) Bundle protocol specification. RFC 5050, Internet Request for Comments, RFC Editor, IETF. http:\/\/www.rfc-editor.org\/rfc\/rfc5050.txt"},{"key":"1393_CR26","first-page":"41","volume-title":"Towards an information theoretic metric for anonymity. Privacy enhancing technologies","author":"A Serjantov","year":"2002","unstructured":"Serjantov A, Danezis G (2002) Towards an information theoretic metric for anonymity. Privacy enhancing technologies. Springer, Berlin, Heidelberg, pp 41\u201353 (Lecture Notes in Computer Science)"},{"issue":"4","key":"1393_CR27","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1007\/s12652-018-0697-3","volume":"10","author":"DK Sharma","year":"2019","unstructured":"Sharma DK, Dhurandher SK, Agarwal D, Arora K (2019) krop: k-means clustering based routing protocol for opportunistic networks. J Ambient Intell Hum Comput 10(4):1289\u20131306","journal-title":"J Ambient Intell Hum Comput"},{"issue":"6","key":"1393_CR28","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.adhoc.2011.11.008","volume":"10","author":"C Shi","year":"2012","unstructured":"Shi C, Luo X, Traynor P, Ammar MH, Zegura EW (2012) Arden: anonymous networking in delay tolerant networks. Ad Hoc Netw 10(6):918\u2013930","journal-title":"Ad Hoc Netw"},{"issue":"5968","key":"1393_CR29","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1126\/science.1177170","volume":"327","author":"C Song","year":"2010","unstructured":"Song C, Qu Z, Blumm N (2010) Limits of predictability in human mobility. Science 327(5968):1018\u20131021","journal-title":"Science"},{"key":"1393_CR30","volume-title":"Data Privacy: foundations, new developments and the big data challenge. Studies in big data","author":"V Torra","year":"2017","unstructured":"Torra V (2017) Data Privacy: foundations, new developments and the big data challenge. Studies in big data. Springer, Berlin"},{"issue":"11","key":"1393_CR31","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1002\/sec.246","volume":"4","author":"G Vakde","year":"2011","unstructured":"Vakde G, Bibikar R, Le Z, Wright M (2011) Enpassant: anonymous routing for disruption-tolerant networks with applications in assistive environments. Secur Commun Netw 4(11):1243\u20131256","journal-title":"Secur Commun Netw"},{"key":"1393_CR12","doi-asserted-by":"crossref","unstructured":"van\u00a0den Hooff J, Lazar D, Zaharia M, Zeldovich N (2015) Vuvuzela: scalable private messaging resistant to traffic analysis. In: Proceedings of the 25th symposium on operating systems principles. ACM, SOSP\u201915, pp 137\u2013152","DOI":"10.1145\/2815400.2815417"},{"issue":"02","key":"1393_CR32","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BB Xuan","year":"2003","unstructured":"Xuan BB, Ferreira A, Jarry A (2003) Computing shortest, fastest, and foremost journeys in dynamic networks. Int J Found Comput Sci 14(02):267\u2013285","journal-title":"Int J Found Comput Sci"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01393-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-019-01393-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01393-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T17:22:07Z","timestamp":1707499327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-019-01393-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,15]]},"references-count":32,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1393"],"URL":"https:\/\/doi.org\/10.1007\/s12652-019-01393-0","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2019,7,15]]},"assertion":[{"value":"4 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}