Neighbor Caching in Multi-hop Wireless Ad Hoc Networks

Abstract

We propose a neighbor caching strategy to overcome the overhead of multi-hop wireless communications. Neighbor caching makes a node possible to expand its caching storage instantaneously by storing its data in the storage of idle neighbors. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The ranking based prediction is an adaptive algorithm that adjusts frequency of neighbor caching and makes neighbor caching flexible according to the idleness of nodes.