Authors: Xiuqi Li, Jun Xu, Jie Wu
Addresses: Department of Mathematics and Computer Science, University of North Carolina at Pembroke, P.O. Box 1510, Pembroke, NC 28272, USA. ' College of Computing, Georgia Institute of Technology, 801 Atlantic Drive, Atlanta, GA 30332-028, USA. ' Department of Computer and Information Sciences, Temple University, 324 Wachman Hall, 1805 N. Broad Street Philadelphia, PA 19122, USA
Abstract: In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or does not keep any route to desired events, such as in query flooding. In this paper, we propose a routing protocol, called hint-based routing by scope decay bloom filter (HR-SDBF), that employs probabilistic hints. In the HR-SDBF protocol, each node maintains some probabilistic hints about the potential desired events and routes queries intelligently based on these probabilistic hints. We also put forward a data structure, scope decay bloom filter (SDBF) to encode the probabilistic hints. With SDBF, the amount of information about an event is propagated, without any loss, within the k-hop neighbourhood of the event source, but decreases outside the k-hop neighbourhood as the distance from the event source increases. Compared to existing query-based protocols, HR-SDBF greatly reduces the amortised network traffic without compromising the query success rate, and achieves a higher energy efficiency. To the best of our knowledge, this is the first query routing protocol in WSNs that utilises probabilistic hints encoded in a variant of the bloom filter. Both the analytic and the experimental results support the performance improvement of our protocol.
Keywords: bloom filters; data-centric routing; hint-based routing; query-based routing; routing protocols; wireless sensor networks; WSNs; high performance computing; wireless networks.
International Journal of High Performance Computing and Networking, 2010 Vol.6 No.3/4, pp.181 - 196
Available online: 30 Dec 2010 *Full-text access for editors Access for subscribers Purchase this article Comment on this article