HR-SDBF: an approach to data-centric routing in WSNs

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.