Email this article 
Open Access
Subscription or Fee Access
Analysis of Bloom Filters for Wireless Sensor Network
Abstract
Recently, Bloom filters have been used increasingly in networking applications, including packet classification, routing in P2P networks[10], string matching in Network Intrusion Detection(NID)[2] , flow rate monitoring etc., and in wireless sensor network(WSN) for updating configuration parameters and to distribute bulk data[13], to hide the data with low energy consumption[14], to identify the data locations in the nodes[15] . The basic Bloom filter has been extended in many ways to suit specific applications. Bloom filters allow false positives but the space savings often outweigh this drawback when the probability of an error is made sufficiently low.
In this paper an attempt is made to survey the ways in which loom filters have been used and modified depending on the variety of network problems.
Keywords
References
B. Bloom. Space/time trade-offs in hash coding with allowable errors. ACM, 13(7):422–426, May 1970.
M. Attig, S. Dharmapurikar, and J. Lockwood, “Implementation resultsof bloom filters for string matching,” in 12th Symp. on Field- Programmable Custom Computing Machines, Apr. 2004, pp. 322–323.
Lichun Li; Bingqiang Wang; Julong Lan;”A Variable Length Counting Bloom Filter” 2nd International conference on computer engineering & Technology(ICCET ) June 2010.
Weijiang Liu; Dandan Huo; Hongbo Liu “Identifying Elephant Flows by Building a Reversible Counting Bloom Filter” Fourth International conference on communication & networking in china 2009, ChinaCOM 2009
Fang Hao; Kodialam, M.; Lakshman, T.V.; “Incremental Bloom Filters” , the 27th conference on computer communication ,IEEE, INFOCOM2008.
D. Guo, J. Wu, H. Chen, and X. Luo. Theory and Network Applications of Dynamic Bloom Filters. In INFOCOM, 2006The Dynamic Bloom Filters
A.Broder M. Mitzenmacher. Network applications of bloom filters: A survey. In Proceedings of the 40thAnnual Allerton Conference on Communication, Control, and Computing, pages 636–646, 2002.
Bruck, J.; Jie Gao; Anxiao Jiang; “Weighted Bloom Filter” , IEEE international symposium on Information Theory, 2006.
Peizhen Lin; Feng Wang; Weiliang Tan; Hui Deng; “Enhancing Dynamic Packet Filtering Technique with d-Left Counting Bloom Filter Algorithm , Second International Conference on Intelligent Networks and Intelligent Systems, 2009. ICINIS '09.
Kumar, J. Xu, and E. W. Zegura. Efficient and scalable query routing for unstructured peer-to-peer networks. In Proc. INFOCOM’05, Miami,Florida, U.S.A., 2005.
Paynter, M.; Kocak, T.; “Fully Pipelined Bloom Filter Architecture”, IEEE Communications Letters, 2008.
L.Fan , P. Cao, J. Almeida, and A. Z. Broder. “Summary Cache: A Scalable Wide Area Web Cache Sharing Protocol.” IEEE/ACM Transactions on Networking 8:3 (2000), 281-293.
Tao Chen; Deke Guo; Xue Liu; Honghui Chen; Xueshan Luo; Junxian Liu; “BDP: A Bloom Filters Based Dissemination Protocol in Wireless Sensor Networks”, IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, 2009. MASS '09.
Jiyu Yang; Xingming Sun; Baowei Wang; Xiangrong Xiao; Xiaoliang Wang; Dong Luo; “Bloom Filter-Based Data Hiding Algorithm in Wireless Sensor Networks”, 5th International Conference on Future Information Technology (FutureTech), 2010
Jardak, C.; Riihijarvi, J.; Mahonen, P.; “Analyzing the Optimal Use of Bloom Filters in Wireless Sensor Networks Storing Replicas”, IEEE Wireless Communications and Networking Conference, 2009. WCNC 2009.
M. Mitzenmacher, “Compressed bloom filters”, IEEE/ACM Trans. On Networking vol 10. No.5 , pp 604 – 612 , 2002
Gutnik and A. Chandrakasan, “Embedded Power Supply for Low- Power DSP,” IEEE Transactions VLSI System, vol. 12, pp. 425-435, 1997.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.