A linear-time probabilistic counting algorithm for database applications
ACM Transactions on Database Systems (TODS)
Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
IEEE/ACM Transactions on Networking (TON)
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
A distributed coordination framework for wireless sensor and actor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
IEEE Communications Magazine
Hi-index | 0.00 |
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.