Date Added: Feb 2012
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining such overlay networks have already been suggested, but most of them are based on an oversimplified wireless communication model. The authors address cooperative caching in wireless networks, where the nodes may be mobile and exchange information in a peer-to-peer fashion. They consider both cases of nodes with large and small-sized caches. For large-sized caches, they devise a strategy where nodes, independent of each other, decide whether to cache some content and for how long.