{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:27:38Z","timestamp":1730280458472,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/lcn.2009.5355053","type":"proceedings-article","created":{"date-parts":[[2009,12,24]],"date-time":"2009-12-24T18:26:49Z","timestamp":1261679209000},"page":"661-668","source":"Crossref","is-referenced-by-count":1,"title":["Content registration in VANETs\u2014 saving bandwidth through node cooperation"],"prefix":"10.1109","author":[{"given":"Christian","family":"Wewetzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bjorn","family":"Scheuermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Lubke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Mauve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2004.1378240"},{"key":"ref30","article-title":"A measurement study of peer-to-peer file sharing systems","author":"saroiu","year":"2002","journal-title":"Proceedings of Multimedia Computing and Networking 2002 (MMCN ”02)"},{"key":"ref10","first-page":"59","article-title":"Reliable hashing without collosion detection","author":"wolper","year":"1993","journal-title":"CAV ’93 Proceedings of the 5th International Conference on Computer Aided Verification"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_32"},{"key":"ref12","first-page":"823","article-title":"An optimal bloom filter replacement","author":"pagh","year":"2005","journal-title":"SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/872785.872787"},{"key":"ref15","first-page":"30","article-title":"The bloomier filter: an efficient data structure for static support lookup tables","author":"chazelle","year":"2004","journal-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2004.05.003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2007.358967"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1031483.1031487"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1080754.1080771"},{"key":"ref4","article-title":"Survey: Network applications of bloom filters: A survey","volume":"1","author":"broder","year":"2003","journal-title":"Internet Mathematics"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20208"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2007.4437818"},{"key":"ref6","first-page":"49","article-title":"Context discovery using attenuated bloom filters in ad-hoc networks","volume":"1","author":"liu","year":"2007","journal-title":"Journal of Internet Engineering"},{"key":"ref29","article-title":"Simulation des Straßenverkehrsflusses (in German language)","volume":"8","author":"wiedemann","year":"1974"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM.2005.36"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1287791.1287800"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/606272.606299"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1195-x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1161064.1161070"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1287748.1287761"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2007.15"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1410043.1410054"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1287748.1287750"},{"key":"ref26","article-title":"US Secure Hash Algorithm 1 (SHA1)","author":"eastlake","year":"2001","journal-title":"RFC 3174 (Informational)"},{"key":"ref25","article-title":"The MD5 Message-Digest Algorithm","author":"rivest","year":"1992","journal-title":"RFC 1321 (Informational)"}],"event":{"name":"2009 IEEE 34th Conference on Local Computer Networks (LCN 2009)","start":{"date-parts":[[2009,10,20]]},"location":"Zurich","end":{"date-parts":[[2009,10,23]]}},"container-title":["2009 IEEE 34th Conference on Local Computer Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5347306\/5354999\/05355053.pdf?arnumber=5355053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,19]],"date-time":"2017-03-19T00:44:22Z","timestamp":1489884262000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5355053\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/lcn.2009.5355053","relation":{},"subject":[],"published":{"date-parts":[[2009,10]]}}}