{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T03:43:37Z","timestamp":1784000617824,"version":"3.55.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T00:00:00Z","timestamp":1534723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Great Project of Fujian Province Science and Technology Plan","award":["2016H6007"],"award-info":[{"award-number":["2016H6007"]}]},{"name":"City School Cooperation Project of Fuzhou Science and the Technology Bureau","award":["2016-G-40"],"award-info":[{"award-number":["2016-G-40"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s13638-018-1221-3","type":"journal-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T09:54:27Z","timestamp":1534758867000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain"],"prefix":"10.1186","volume":"2018","author":[{"given":"Huakun","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2173-4612","authenticated-orcid":false,"given":"Ruliang","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lifei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Du","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,20]]},"reference":[{"key":"1221_CR1","doi-asserted-by":"crossref","unstructured":"O. Novo, Blockchain meets IoT: an architecture for scalable access management in IoT. IEEE Internet Things J 5(2), 1184\u20131195 (2018)","DOI":"10.1109\/JIOT.2018.2812239"},{"key":"1221_CR2","doi-asserted-by":"crossref","unstructured":"A. Reyna et al., On blockchain and its integration with IoT. Challenges and opportunities. Futur Gener Comput Syst 88, 173\u2013190 (2018)","DOI":"10.1016\/j.future.2018.05.046"},{"issue":"2","key":"1221_CR3","doi-asserted-by":"publisher","first-page":"44","DOI":"10.3390\/info8020044","volume":"8","author":"Q Xia","year":"2017","unstructured":"Q. Xia et al., BBDS: blockchain-based data sharing for electronic medical records in cloud environments. Information 8(2), 44 (2017)","journal-title":"Information"},{"key":"1221_CR4","unstructured":"A.C. Ekblaw, MedRec: blockchain for medical data access, permission management and trend analysis (Diss. Massachusetts Institute of Technology, Washington D.C., 2017)"},{"key":"1221_CR5","doi-asserted-by":"crossref","unstructured":"M.S. Ali, K. Dolui, F. Antonelli, IoT data privacy via blockchains and IPFS, International Conference on the Internet of Things (ACM, New York, 2017)","DOI":"10.1145\/3131542.3131563"},{"key":"1221_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13638-017-1011-3","volume":"61","author":"H Cheng","year":"2018","unstructured":"H. Cheng et al., Data quality analysis and cleaning strategy for wireless sensor networks. EURASIP J Wirel Commun Netw 61, 1\u201311 (2018)","journal-title":"EURASIP J Wirel Commun Netw"},{"key":"1221_CR7","series-title":"Ubiquitous Wireless Broadband (ICUWB), 2017 IEEE 17th International Conference on. IEEE","doi-asserted-by":"publisher","DOI":"10.1109\/ICUWB.2017.8251003","volume-title":"Towards using blockchain technology for IoT data access protection","author":"N Rifi","year":"2017","unstructured":"Rifi, Nabil, et al. Towards using blockchain technology for IoT data access protection. Ubiquitous Wireless Broadband (ICUWB), 2017 IEEE 17th International Conference on. IEEE, 2017."},{"issue":"3","key":"1221_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"C. B\u00f6hm, S. Berchtold, D.A. Keim, Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput Surv 33(3), 322\u2013373 (2001)","journal-title":"ACM Comput Surv"},{"key":"1221_CR9","unstructured":"A. Shrivastava, P. Li, Densifying one permutation hashing via rotation for fast near neighbor search. Int Conf Mach Learn 32, I\u2013557 (2014)"},{"key":"1221_CR10","unstructured":"A. Andoni et al., Practical and optimal LSH for angular distance. Adv Neural Inf Proces Syst 1\u20139 (2015)"},{"key":"1221_CR11","doi-asserted-by":"crossref","unstructured":"M. Datar et al., Locality-sensitive hashing scheme based on p-stable distributions, Proceedings of the twentieth annual symposium on Computational geometry (ACM, Brooklyn, 2004)","DOI":"10.1145\/997817.997857"},{"key":"1221_CR12","doi-asserted-by":"crossref","unstructured":"K. Weinberger et al., Feature hashing for large scale multitask learning, Proceedings of the 26th Annual International Conference on Machine Learning (ACM, Quebec, 2009)","DOI":"10.1145\/1553374.1553516"},{"key":"1221_CR13","unstructured":"Q. Lv et al., Multi-probe LSH: efficient indexing for high-dimensional similarity search, Proceedings of the 33rd international conference on Very large data bases (VLDB Endowment, Vienna, 2007)"},{"key":"1221_CR14","series-title":"Europe and MENA Cooperation Advances in Information and Communication Technologies","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46568-5_53","volume-title":"Towards a novel privacy-preserving access control model based on blockchain technology in IoT","author":"A Ouaddah","year":"2017","unstructured":"A. Ouaddah, A.A. Elkalam, A.A. Ouahman, Towards a novel privacy-preserving access control model based on blockchain technology in IoT, Europe and MENA Cooperation Advances in Information and Communication Technologies (Springer, Cham, 2017)"},{"key":"1221_CR15","unstructured":"IPFS \u2013 the permanent web. Retrieved May 18, 2017 from \n                    https:\/\/github.com\/ipfs\/ipfs\n                    \n                  . Accessed 16 Aug 2018"},{"key":"1221_CR16","series-title":"IEEE International Conference on Big DataIEEE","first-page":"2652","volume-title":"An improved P2P file system scheme based on IPFS and Blockchain","author":"Y Chen","year":"2017","unstructured":"Y. Chen et al., An improved P2P file system scheme based on IPFS and Blockchain, IEEE International Conference on Big DataIEEE (2017), pp. 2652\u20132657"},{"key":"1221_CR17","doi-asserted-by":"crossref","unstructured":"P. Indyk, R. Motwani, Approximate nearest neighbors: towards removing the curse of dimensionality, Proceedings of the thirtieth annual ACM symposium on Theory of computing (ACM, Dallas, 1998)","DOI":"10.1145\/276698.276876"},{"key":"1221_CR18","doi-asserted-by":"crossref","unstructured":"J.M. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (ACM, Redmond, 1997)","DOI":"10.1145\/258533.258653"},{"issue":"2","key":"1221_CR19","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539798347177","volume":"30","author":"E Kushilevitz","year":"2000","unstructured":"E. Kushilevitz, R. Ostrovsky, Y. Rabani, Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30(2), 457\u2013474 (2000)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"1221_CR20","first-page":"518","volume":"99","author":"A Gionis","year":"1999","unstructured":"A. Gionis, P. Indyk, R. Motwani, Similarity search in high dimensions via hashing. Vldb. 99(6), 518\u2013529 (1999)","journal-title":"Vldb."},{"issue":"6","key":"1221_CR21","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"S. Arya et al., An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J ACM 45(6), 891\u2013923 (1998)","journal-title":"J ACM"},{"key":"1221_CR22","unstructured":"A.Z. Broder, On the resemblance and containment of documents, Compression and Complexity of Sequences 1997. Proceedings (IEEE), Salerno, p. 1997"},{"key":"1221_CR23","doi-asserted-by":"crossref","unstructured":"C. Liu et al., Cross domain search by exploiting wikipedia, Data Engineering (ICDE), 2012 IEEE 28th International Conference on (IEEE, Washington D.C., 2012)","DOI":"10.1109\/ICDE.2012.13"},{"issue":"9","key":"1221_CR24","doi-asserted-by":"publisher","first-page":"824","DOI":"10.14778\/2311906.2311910","volume":"5","author":"J Fan","year":"2012","unstructured":"J. Fan et al., Seal: spatio-textual similarity search. Proc VLDB Endowment 5(9), 824\u2013835 (2012)","journal-title":"Proc VLDB Endowment"},{"key":"1221_CR25","unstructured":"ZhuMing-dong, S. De-rong, N.T.-z. Kouyue, Y. Ge, A LSH-based method for similarity queries on binary hybrid data. Chin J Comput 40, 1\u201315 (2017)"},{"key":"1221_CR26","doi-asserted-by":"crossref","unstructured":"L. Chen et al., Temporal spatial-keyword top-k publish\/subscribe, Data Engineering (ICDE), 2015 IEEE 31st International Conference on (IEEE, Seoul, 2015)","DOI":"10.1109\/ICDE.2015.7113289"},{"key":"1221_CR27","doi-asserted-by":"crossref","unstructured":"J. Lu, Y. Lu, C. Gao, Reverse spatial and textual k nearest neighbor search, Proceedings of the 2011 ACM SIGMOD International Conference on Management of data (ACM, Athens, 2011)","DOI":"10.1145\/1989323.1989361"},{"issue":"1","key":"1221_CR28","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","volume":"8","author":"S Har-Peled","year":"2012","unstructured":"S. Har-Peled, P. Indyk, R. Motwani, Approximate nearest neighbor: towards removing the curse of dimensionality. Theory Comput 8(1), 321\u2013350 (2012)","journal-title":"Theory Comput"},{"key":"1221_CR29","series-title":"Workshop on Algorithms and Data Structures","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73951-7_4","volume-title":"Spherical LSH for approximate nearest neighbor search on unit hypersphere","author":"K Terasawa","year":"2007","unstructured":"K. Terasawa, Y. Tanaka, Spherical LSH for approximate nearest neighbor search on unit hypersphere, Workshop on Algorithms and Data Structures (Springer, Berlin, Heidelberg, 2007)"},{"key":"1221_CR30","doi-asserted-by":"crossref","unstructured":"A. Dasgupta, R. Kumar, T. Sarl\u00f3s, Fast locality-sensitive hashing, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining (ACM, Sydney, 2011)","DOI":"10.1145\/2020408.2020578"},{"issue":"9","key":"1221_CR31","doi-asserted-by":"publisher","first-page":"2604","DOI":"10.1109\/JPROC.2012.2193849","volume":"100","author":"M Slaney","year":"2012","unstructured":"M. Slaney, Y. Lifshits, J. He, Optimal parameters for locality-sensitive hashing. Proc. IEEE 100(9), 2604\u20132623 (2012)","journal-title":"Proc. IEEE"},{"key":"1221_CR32","unstructured":"UCI machine learning repository, MNIST, 1999. \n                    http:\/\/yann.lecun.com\/exdb\/mnist\n                    \n                  . Accessed 16 Aug 2018"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-018-1221-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-018-1221-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-018-1221-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:05:27Z","timestamp":1566241527000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-018-1221-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,20]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["1221"],"URL":"https:\/\/doi.org\/10.1186\/s13638-018-1221-3","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,20]]},"assertion":[{"value":"3 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"208"}}