Rarest first and choke algorithms are enough
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Adapting BitTorrent to Wireless Ad Hoc Networks
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
| Hi-index | 0.00 |
Classical content sharing applications like BitTorrent are not designed to run over wireless networks. When adapting them to these constrained networks, two main problems arise. On one hand, exchanging content pieces with far nodes results in 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 sharing and diversification efforts and decides on the optimal neighboring scope of a node. We also consider the diversification incentives problem and evaluates the impact of nodes' mobility on the P2P strategy to be adopted. Through extensive simulations, we prove that our solution achieves both better download time and sharing ratio than uni-metric solutions.