期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：3
DOI：10.15680/ijircce.2015.0303159
出版社：S&S Publications
摘要：Storage nodes are predictable to be located as an intermediate tier of huge scale sensor networks forcaching the composed sensor readings and responding to queries with benefits of influence and storage reduction forstandard sensors. Nevertheless, an essential issue is that the compromised storage node may not only source theprivacy problem, but also arrival fake/curtailed query results. We propose a graceful yet competent dummy readingbased anonymization constitution, beneath which the query result steadfastness can be certain by our proposedverifiable top-k query (VQ) schemes. Compared with accessible machinery, the VQ schemes have an essentiallydifferent design attitude and realize the lower communication complexity at the cost of slight exposure capabilitydegradation. Analytical studies, geometric simulations, and archetype implementations are conducted to exhibit thepracticality of our proposed methods
关键词：Sensor networks; Top-k query result completeness; VQ scheme
