Adapting BitTorrent to Wireless Ad Hoc Networks

  • Mohamed Karim Sbai
  • Chadi Barakat
  • Jaeyoung Choi
  • Anwar Al Hamra
  • Thierry Turletti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5198)

Abstract

BitTorrent is one of the Internet’s most efficient content distribution protocols. It is known to perform very well over the wired Internet where end-to-end performance is almost guaranteed. However, in wireless ad hoc networks, many constraints appear as the scarcity of resources and their shared nature, which make running BitTorrent with its default configuration not lead to best performances. To these constraints it adds the fact that peers are both routers and end-users and that TCP-performance drops seriously with the number of hops. We show in this work that the neighbor selection mechanism in BitTorrent plays an important role in determining the performance of the protocol when deployed over a wireless ad hoc network. It is no longer efficient to choose and treat with peers independently of their location. A first solution is to limit the scope of the neighborhood. In this case, TCP connections are fast but there is no more diversity of pieces in the network: pieces propagate in a unique direction from the seed to distant peers. This prohibits peers from reciprocating data and leads to low sharing ratios and suboptimal utilization of network resources. To recover from these impairments, we propose an enhancement to BitTorrent which aims to minimize the time to download the content and at the same time to enforce cooperation among peers. Our solution considers a restricted neighborhood to reduce routing overhead and to improve throughput, while establishing few connections to remote peers to improve diversity of pieces. With the help of extensive NS-2 simulations, we show that these enhancements to BitTorrent significantly improve the file completion time while fully profiting from the incentives implemented in BitTorrent to enforce fair sharing.

Keywords

BitTorrent wireless ad hoc networks neighbor selection piece selection completion time fair sharing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    NS: The Network Simulator, http://www.isi.edu/nsnam/ns/
  3. 3.
    Ding, G., Bhargava, B.: Peer-to-Peer File-Sharing over Mobile Ad hoc Networks. In: IEEE PERCOM-W, Orlando, USA (2004)Google Scholar
  4. 4.
    Michiardi, P., Urvoy-Keller, G.: Performance analysis of cooperative content distribution for wireless ad hoc networks. In: WONS 2007, Obergurgl (2007)Google Scholar
  5. 5.
    The Gnutella specification (2000), http://dss.clip2.com/GnutellaProtocol04.pdf
  6. 6.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., shenker, S.: A scalable content-addressable networks. In: ACM SIGCOMM (2001)Google Scholar
  7. 7.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM (2001)Google Scholar
  8. 8.
    Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: an infrastructure for fault-resilient wide-area location and routing. T.R. UCB//CSD-01-1141, U.C.Berkeley (2001)Google Scholar
  9. 9.
    Rowstron, A., Druschel, P.: Pastry: scalable, diributed object location and routing for large -scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Oliviera, L.B., Siqueira, I.G., Loureiro, A.A.: Evaluation of ad hoc routing protocols under a peer-to-peer application. In: WCNC (2003)Google Scholar
  11. 11.
    Klemm, A., Lindermann, C., Waldhorst, O.: A special-purpose peer-to-peer file sharing system for mobile ad hoc networks. In: VTC (2003)Google Scholar
  12. 12.
    Das, S.M., Pucha, H., Hu, Y.C.: Ekta: an efficient peer-to-peer substrate for distributed applications in mobile ad hoc networks. TR-ECE-04-04, Purdue University (2004)Google Scholar
  13. 13.
    Legout, A., Urvoy-Keller, G., Michiardi, P.: Rarest First and Choke Algorithms Are Enough. In: IMC 2006, Rio de Janeiro (2006)Google Scholar
  14. 14.
    Nandan, A., Das, S., Pau, G., Gerla, M.: Cooperative downloading in vehicular ad hoc networks. In: WONS, Washington, USA (2005)Google Scholar
  15. 15.
    Rajagopalan, S., Shen, C.-C.: A cross-Layer Decentralized BitTorrent for Mobile Ad hoc Networks. In: MOBIQUITOUS, San Jose, USA (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mohamed Karim Sbai
    • 1
  • Chadi Barakat
    • 1
  • Jaeyoung Choi
    • 1
  • Anwar Al Hamra
    • 1
  • Thierry Turletti
    • 1
  1. 1.Project-Team Planète, INRIA Sophia AntipolisFrance

Personalised recommendations