Classical content sharing applications like BitTorrent can not be directly used in wireless ad hoc networks. When adapting them to these constrained networks, one faces two main problems. On one hand, exchanging content pieces with far nodes yields an important routing overhead. On the other hand, it is necessary to send some content pieces to far nodes to increase the diversity of information in the network, which fosters reciprocity and parallel exchanges. In this paper, we study both of these problems and propose a joint solution for them. Unlike uni-metric approaches, our solution considers relevant performance metrics together as throughput, sharing and routing overhead. We define a new neighbor selection strategy that balances between sharing and diversification efforts and decides on the optimal scope of a node. It also considers the diversification incentives problem. Through extensive simulations, we prove that our solution realizes both better download time and sharing ratio than uni-metric solutions.