Secure K-Nearest neighbor queries in two-tiered mobile wireless sensor networks  

作　　者：Lihong Fan Liang Liu Hang Gao Zuchao Ma Yuting Wu 

机构地区：[1]Colleages of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing,211100,China

出　　处：《Digital Communications and Networks》2021年第2期247-256,共10页数字通信与网络（英文版）

基　　金：This work is supported by the Aeronautical Science Foundation of China under Grant 20165515001;the National Natural Science Foundation of China under Grant No.61402225;State Key Laboratory for smart grid protection and operation control Foundation,and the Science and Technology Funds from National State Grid Ltd.(The Research on Key Technologies of Distributed Parallel Database Storage and Processing based on Big Data).

摘　　要：Tiered Mobile Wireless Sensor Network(TMWSN)is a new paradigm introduced by mobile edge computing.Now it has received wide attention because of its high scalability,robustness,deployment flexibility,and it has a wide range of application scenarios.In TMWSNs,the storage nodes are the key nodes of the network and are more easily captured and utilized by attackers.Once the storage nodes are captured by the attackers,the data stored on them will be exposed.Moreover,the query process and results will not be trusted any more.This paper mainly studies the secure KNN query technology in TMWSNs,and we propose a secure KNN query algorithm named the Basic Algorithm For Secure KNN Query(BAFSKQ)first,which can protect privacy and verify the integrity of query results.However,this algorithm has a large communication overhead in most cases.In order to solve this problem,we propose an improved algorithm named the Secure KNN Query Algorithm Based on MR-Tree(SEKQAM).The MR-Trees are used to find the K-nearest locations and help to generate a verification set to process the verification of query results.It can be proved that our algorithms can effectively guarantee the privacy of the data stored on the storage nodes and the integrity of the query results.Our experimental results also show that after introducing the MR-Trees in KNN queries on TMWSNs,the communication overhead has an effective reduction compared to BAFSKQ.

关 键 词：TMWSNs Secure KNN queries MR-Tree PRIVACY Integrity Communication overhead 

分 类 号：TP212[自动化与计算机技术—检测技术与自动化装置] TP309[自动化与计算机技术—控制科学与工程]