首页 | 本学科首页   官方微博 | 高级检索  
     

两层传感网中能量高效的隐私保护范围查询方法
引用本文:戴华, 杨庚, 肖甫, 周强, 何瑞良. 两层传感网中能量高效的隐私保护范围查询方法[J]. 计算机研究与发展, 2015, 52(4): 983-993. DOI: 10.7544/issn1000-1239.2015.20140066
作者姓名:戴华  杨庚  肖甫  周强  何瑞良
作者单位:1.1(南京邮电大学计算机学院 南京 210013);2.2(宽带无线通信与传感网技术教育部重点实验室(南京邮电大学) 南京 210013) (daihua@njupt.edu.cn)
基金项目:国家自然科学基金项目(61402014,61472193,61300240,61272084,61202004,61373137,61373138);江苏省高校自然科学研究重大项目(11KJA520002);面上项目(14KJB520027);教育部高等学校博士学科点专项科研基金项目(20113223110003,20093223120001);中国博士后科研基金项目(2013M541703);江苏省六大人才高峰项目(2013-DZXX-014);江苏省博士后科研资助计划项目(1301042B)
摘    要:具有隐私保护能力的范围查询处理方法是当前无线传感器网络(wireless sensor networks, WSNs)数据管理应用技术中具有挑战性的研究内容.针对2层传感器网络环境,提出了一种能量高效的隐私保护范围查询处理方法(energy-efficient and privacy-preserving range query, EPRQ).在数据存储阶段,感知节点对其采集的数据进行加密处理,并利用0-1编码和Hash消息身份认证编码机制计算各采集数据的最小化比较因子,然后将密文和编码数据上传至存储节点.在查询处理阶段,基站计算用户查询的目标范围区间的比较因子,并作为查询指令发送给存储节点;再由存储节点利用0-1编码验证机制的数值比较特性,实现无需明文数值参与下的数据大小比较,进而确定查询结果密文数据集,并返回基站;基站解密密文数据,获得最终的查询结果.理论分析和实验结果表明,该方法能够实现对感知数据、查询结果和目标范围区间的隐私保护,且与现有方法相比具有更高的能耗效率.

关 键 词:2层传感器网络  隐私保护  范围查询  0-1编码验证  对称加密  Hash消息身份认证

An Energy-Efficient and Privacy-Preserving Range Query Processing in Two-Tiered Wireless Sensor Networks
Dai Hua, Yang Geng, Xiao Fu, Zhou Qiang, He Ruiliang. An Energy-Efficient and Privacy-Preserving Range Query Processing in Two-Tiered Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2015, 52(4): 983-993. DOI: 10.7544/issn1000-1239.2015.20140066
Authors:Dai Hua    Yang Geng    Xiao Fu    Zhou Qiang    He Ruiliang
Affiliation:1.1(School of Computer Science & Technology, Nanjing University of Posts and Telecommunications, Nanjing 210013);2.2(Key Laboratory of Broadband Wireless Communication & Sensor Network Technology(Nanjing University of Posts and Telecommunications), Ministry of Education, Nanjing 210013)
Abstract:Applying range query processing in wireless sensor networks (WSNs) while preserving data privacy is a challenge. This paper proposes an energy-efficient and privacy-preserving range query processing in two-tiered wireless sensor networks, which is denoted as EPRQ. In data storing phase, each sensor node in the query range firstly encrypts its collected data, and then encodes them into the minimized comparison factors by 0-1,encoding and hashed message authentication coding mechanism. After that, it transmits the encoded and encrypted data to the corresponding storage node. When the base station begins a range query, the bounds of the range are encoded into comparison factors, and then disseminate them to the corresponded storage nodes. According to the numerical comparison property of 0-1,encoding verification mechanism, an encrypted data set containing the query result is generated by such storage nodes, even without knowing the actual values of the collected data and queried range. Then, the storage nodes send such encrypted data set to the base station as query responses, and the final query result is obtained after decryption by the base station. The theoretical analysis and experimental results show that the EPRQ ensure the privacy of the collected data, the query result and the query range, and it has better performance than the existing methods in the energy consumption.
Keywords:two-tiered wireless sensor networks  privacy preserving  range query  0-1 encoding verification  symmetric encryption  hashed message authentication coding
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机研究与发展》浏览原始摘要信息
点击此处可从《计算机研究与发展》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号