Bloom Filter-Based Data Hiding Algorithm in Wireless Sensor Networks
Authors:
- Jiyu YangJYJiyu Yang
- Baowei WangBWBaowei Wang
- Xiaoliang WangXWXiaoliang Wang
- Dong LuoDLDong Luo
- 1 January 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21597006,p. 1-6
Abstract
Sensor networks hold the promise of facilitating large-scale and real-time data processing in complex environments. Data security is an extremely crucial issue for many sensor network applications. Data hiding technique, which is considered less consumptive than cryptology, is introduced to guarantee the security of the sensitive data in wireless sensor networks. However, the low invisibility of such schemes has always been the most fatal weaknesses. In this paper, we propose an innovative data hiding method. Sensitive data are uniformly and randomly embedded into the ordinary data by using the space-efficient randomized data structure characteristic of Bloom Filter. Full embedding and simple fixed embedding laws are avoided. Any intermediate nodes of the network and eavesdroppers are more difficult to detect the existence of sensitive data. Experimental results and performance analysis demonstrate that the proposed scheme can efficiently protect the sensitive data, without affecting the transmission and usability of the ordinary data. At the same time, this method also has little additional energy consumption.Keywords
This publication has 9 references indexed in Scilit:
- Energy-Aware Adaptive Watermarking for Real-Time Image Delivery in Wireless Sensor Networks2008
- Secure Data Transmission of Wireless Sensor Network Based on Information Hiding2007
- Chaining watermarks for detecting malicious modifications to streaming dataInformation Sciences, 2006
- Security in wireless sensor networks: issues and challenges2006
- Anonymity and information hiding in multiagent systemsJournal of Computer Security, 2005
- TinySec2004
- Real-time watermarking techniques for sensor networks2003
- A survey on sensor networksIEEE Communications Magazine, 2002
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970