Data caching in ad hoc networks using Bloom filters

Abstract

Data caching provides efficient data access by maintaining replicas of data in strategic parts of the network. However, current research in this area does not manage memory space of each node efficiently. We propose an improvement by considering Bloom filters, a fast, space efficient probabilistic method for looking up data. We compare the system the system performance with and without Bloom filters and show the performance is very close, even though the Bloom filter only takes half the space of the nearest cache table.