The current weak state routing schemes cannot facilitate in-network queries effectively. When a query is given for an item at an arbitrary node, disturbance in unrelated routing entries are likely stronger than the useful information in the right routing entries. Consequently, the majority of queries are moved towards wrong nodes. To solve this problem, this paper presents DWalker, an efficient weak state routing scheme-based design based on decaying bloom filters. DWalker uses a bloom filter to represent the summary information of resources at each node and then propagated a bloom filter within a propagation range. The amount of information in each bloom filter decreases exponentially with the distance from the source. DWalker makes the max propagation range less than the expected distance between any two nodes; hence, effectively tackling the problem of multi-path propagation of a decaying bloom filter. DWalker replaces a single bloom filter with multiple bloom filters as a routing entry and holds more routing information. DWalker can ensure that any query can be forwarded in the right direction with high a probability that is based on the proportion of bits set to 1 in a bloom filter and the least number of bits set to 1 in an entry bloom filter for a query. The analysis and simulation of results show that DWalker can make many queries that can be forwarded in the right direction to achieve a high query hit rate with low cost and low delay.