Top-k query result completeness verification in tiered sensor networks

Chia Mu Yu, Guo Kai Ni, Ing Yi Chen, Erol Gelenbe, Sy Yen Kuo

研究成果: Article同行評審

36 引文 斯高帕斯(Scopus)

摘要

Storage nodes are expected to be placed as an intermediate tier of large scale sensor networks for caching the collected sensor readings and responding to queries with benefits of power and storage saving for ordinary sensors. Nevertheless, an important issue is that the compromised storage node may not only cause the privacy problem, but also return fake/incomplete query results. We propose a simple yet effective dummy reading-based anonymization framework, under which the query result integrity can be guaranteed by our proposed verifiable top-k query (VQ) schemes. Compared with existing works, the VQ schemes have a fundamentally different design philosophy and achieve the lower communication complexity at the cost of slight detection capability degradation. Analytical studies, numerical simulations, and prototype implementations are conducted to demonstrate the practicality of our proposed methods.

原文English
文章編號6665142
頁(從 - 到)109-124
頁數16
期刊IEEE Transactions on Information Forensics and Security
9
發行號1
DOIs
出版狀態Published - 一月 2014

指紋 深入研究「Top-k query result completeness verification in tiered sensor networks」主題。共同形成了獨特的指紋。

引用此