An Exact Top-k Query Algorithm with Privacy Protection in Wireless Sensor Networks
An Exact Top-k Query Algorithm with Privacy Protection in Wireless Sensor Networks
复制标题
无线传感器网络中具有隐私保护的精确Top-k查询算法
DOI：
10.1155/2014/749049
复制
发表时间：
2014
影响因子：
2.3
通讯作者：
Qin XiaoLin
中科院分区：
文献类型：
--
作者：
Huang Haiping;Feng Juan;Wang Ruchuan;Qin XiaoLin
针对无线传感器网络（WSN）中查询者试图寻找源节点的k个最高或最短报告值的Top-k查询问题，利用隐私保护技术，提出了一种基于过滤器和数据分布表的精确Top-k查询算法（简称ETQFD）。该算法精确地进行查询，同时利用圆锥截面隐私功能防止真实数据的泄露，从而保证网络节点的安全性。在该方案中，WSN中的每个节点使用数据分布表来反映自身数据的分布情况，并保留精确的过滤器，只返回可能是查询结果的数据，从而降低网络的能耗，延长网络的生命周期。此外，节点的数据被封装了一个基于二次曲线的隐私保护功能。使用合成数据集对算法的性能进行了测试。性能分析和仿真结果表明，与现有算法相比，ETQFD算法节能且网络寿命更长。同时，该算法也保证了数据的隐私性。
Aimed at the Top-k query problems in the wireless sensor networks (WSN) where enquirers try to seek the k highest or shortest reported values of the source nodes, using privacy protection technology, we present an exact Top-k query algorithm based on filter and data distribution table (shorted for ETQFD). The algorithm does the query exactly and meanwhile uses conic section privacy function to prevent the disclosure of the real data and then to promise the security of nodes in network. In this proposal, each node in WSN uses data distribution table to reflect the distribution of its own data and keeps exact filter to just return data which is possibly to be the result of the query, so as to reduce the energy cost of network and prolong network lifetime. In addition, data of node is packaged with a privacy protection function based on conic section. The algorithm's performance is examined with respect to a number of parameters using synthetic datasets. Performance analysis and simulation results illustrate that, compared to existing algorithms, ETQFD is energy-efficient and the network lifetime in our algorithm is longer. At the same time, privacy of data in this algorithm is also guaranteed.