Privacy-preserving max/min query in two-tiered wireless sensor networks

详细信息    查看全文

• 作者：Yonglei Yao^a ; ^b ; ^{ylyao@nuist.edu.cn} ; Naixue Xiong^c ; ^{nxiong@cs.gsu.edu} ; Jong Hyuk Park^d ; ^{jhpark1@snut.ac.kr} ; Li Ma^a ; ^b ; ^{mali@nuist.edu.cn} ; Jingfa Liu^a ; ^b ; ^{jfliu@nuist.edu.cn}
• 关键词：Two-tiered WSN ; Storage node ; Privacy ; Max/min query
• 刊名：Computers and Mathematics with Applications
• 出版年：2013
• 出版时间：May, 2013
• 年：2013
• 卷：65
• 期：9
• 页码：1318-1325
• 全文大小：310 K

文摘

In a two-tiered wireless sensor network, resource-limited sensor nodes act as the lower layer for sensing data, and resource-rich storage nodes act as the upper layer for storing data and processing queries from the sink. This architecture has been widely adopted because it can save power and storage consumptions for sensors and improve the efficiency of query processing. However, storage nodes may be compromised in a hostile environment and breach privacy of sensor data. Although privacy-preserving range query and Top- query have been studied, query for maximum or minimum has not been well addressed. In this paper, we propose a privacy-preserving protocol specializing for MAX/MIN query that prevents adversaries from gaining sensitive information from sensor collected data. To preserve privacy, Prefix Membership Verification approach is employed to encode sensor data such that a storage node can correctly process max/min queries over encoded data without knowing their actual values. Detailed theoretical and quantitative results confirm the high efficacy and efficiency of the proposed schemes.