In this paper we examine opportunistic content distribution. We design and evaluate a caching strategy where a node will fetch and share contents on behalf of other nodes, although the contents are not of its own interest. We propose three caching options for improving the use of network resources: relay request on demand, hop-limit, and greedy relay request. The proposed strategies are implemented in the OMNeT++ simulator and evaluated on mobility traces from Legion Studio that have churn. We also compare our strategies with a strategy from the literature. The results are analyzed and they show that the use of opportunistic caching for a community of nodes may enhance the performance marginally while overhead increases significantly.