Top-k query result completeness verification in sensor networks

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

In large scale sensor networks, storage nodes may be placed as an intermediate tier for caching the sensor readings and respond to queries, resulting in reduced power consumption and storage savings for sensors. However if a storage node is compromised, it will create privacy issues and may return fake/incomplete results. Thus we suggest a simple yet effective dummy reading-based anonymization framework, whereby query result integrity can be guaranteed by our proposed Verifiable top-k Query (VQ) scheme. Compared to existing work, VQ schemes have a different design philosophy and achieve the lowest communication complexity, with only constant overhead, at with a small degradation of detection capability. Analysis and numerical examples demonstrate the practicality of our proposed approach.

Original languageEnglish
Title of host publication2013 IEEE International Conference on Communications Workshops, ICC 2013
Pages1026-1030
Number of pages5
DOIs
StatePublished - 2013
Event2013 IEEE International Conference on Communications Workshops, ICC 2013 - Budapest, Hungary
Duration: 9 Jun 201313 Jun 2013

Publication series

Name2013 IEEE International Conference on Communications Workshops, ICC 2013

Conference

Conference2013 IEEE International Conference on Communications Workshops, ICC 2013
CountryHungary
CityBudapest
Period9/06/1313/06/13

Fingerprint Dive into the research topics of 'Top-k query result completeness verification in sensor networks'. Together they form a unique fingerprint.

Cite this