Abstract
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.
This work was supported by the ITEA European project on experience sharing in mobile communities (ExpeShare).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
BitTorrent protocol, http://wiki.theory.org/BitTorrentSpecification
Michiardi, P., Urvoy-Keller, G.: Performance analysis of cooperative content distribution for wireless ad hoc networks. In: WONS 2007, Obergurgl (2007)
Sbai, M.K., Barakat, C., Choi, J., Al Hamra, A., Turletti, T.: Adapting BitTorrent to wireless ad hoc networks. In: Ad-Hoc Now 2008, Sophia Antipolis, France (2008)
Klemm, A., Lindermann, C., Waldhorst, O.: A special-purpose peer-to-peer file sharing system for mobile ad hoc networks. In: VTC 2003 (2003)
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)
Legout, A., Urvoy-Keller, G., Michiardi, P.: Rarest First and Choke Algorithms Are Enough. In: IMC 2006, Rio de Janeiro, Brazil (2006)
NS: The Network Simulator, http://www.isi.edu/nsnam/ns/
Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. In: SIGCOMM 1994, London, UK (1994)
Salhi, E., Sbai, M.K., Barakat, C.: Neighborhood selection in mobile P2P networks. In: Algotel conference, Carry-Le-Rouet, France (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Sbai, M.K., Barakat, C. (2009). Revisiting P2P Content Sharing in Wireless Ad Hoc Networks. In: Spyropoulos, T., Hummel, K.A. (eds) Self-Organizing Systems. IWSOS 2009. Lecture Notes in Computer Science, vol 5918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10865-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-10865-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10864-8
Online ISBN: 978-3-642-10865-5
eBook Packages: Computer ScienceComputer Science (R0)