CBFR: Bloom Filter Routing With Gradual Forgetting for Tree-Structured Wireless Sensor Networks With Mobile Nodes
In tree-structured data collection sensor networks, packets are routed towards a sink node by iteratively choosing a node's immediate parent node as the next hop. It is however beyond the scope of these routing protocols to transfer messages along the reverse path, i.e., from the sink to individual nodes in the network. In this paper, the authors present CBFR, a novel routing scheme that builds upon collection protocols to enable efficient point-to-point communication. They propose the use of space-efficient data structures known as Bloom filters to efficiently store routing tables on the networked devices.