On optimal cooperative route caching in large, memory-limited wireless ad hoc networks

Caching is a popular mechanism for enhancing performance in various layers and applications of computer networking. We introduce both a model and algorithms for caching routing information in large, memory-limited wireless ad hoc networks. Each host can cache only a small fraction of the network and must rely on flooding to acquire information that has not been locally cached. To constrain flooding, the network uses a cooperative caching model where every node provides its route cache contents to others when they flood. Given the host memory capacity limitations, we are faced with the problem of allocating destinations to caches in an efficient manner. We propose the class of Best State/Best Cost (BSBC) cooperative caching algorithms that aim to minimize the overall network search effort.