Efficient content distribution in wireless P2P networks
Article No.: 27, Pages 1 - 6
Abstract
With the development of wireless communication technologies and the popularity of the P2P applications, an important problem is to determine how to distribute data efficiently in wireless P2P networks. However, data distribution in wireless P2P networks faces many challenges compared with that in the traditional wired networks. One of the challenges is the contention problem. In this paper, we propose a conflict-free broadcasting scheme to address the problem of file sharing in wireless P2P networks. This scheme not only makes use of the broadcasting nature of the radio channel, but also schedules multiple transmissions simultaneously to take advantage of the frequency reuse of a multi-hop wireless network. It can minimize the completion time experienced by the users. We also deduce a lower bound of the completion time. Our simulation results show that our algorithm is promising.
References
[1]
The official BitTorrent website, http://www.bittorrent.com/
[2]
The official Gnutella website, http://www.gnutella.com/
[3]
The official Kazaa website, http://www.kazaa.com/
[4]
The official Nepster website, http://www.nepster.com/
[5]
Bhat, P. B., Raghavendra, C. S., and Prasanna, V. K. 2003. Efficient Collective Communication in Distributed Heterogeneous Systems. Journal of Parallel and Distributed Computing, Vol. 63, No. 3, pp. 251--263, March 2003.
[6]
Chan, J. S., Li, V. O. K. and Lui, K. S. 2007. Performance Comparison of Scheduling Algorithms for Peer-to-Peer Collaborative file distribution. IEEE Journal on Selected Areas in Communications, Vol. 25, pp. 146 -- 154, January 2007.
[7]
Ephremids, A. and Truong, T. V. 1990. Scheduling Broadcasts in Multihop Radio Networks. IEEE Transactions on Communication. Vol. 38, pp. 456--460, April, 1990.
[8]
Felber, P. and Biersack, E. W. 2005. Cooperative Content Distribution: Scalability Through Self-Organization. In Lecture Notes in Computer Science, Vol. 3460, pp. 343--357, May 2005.
[9]
Garey, M. R. and Johnson, D. S. 1979. Computers and Intractibility-A Guide to the Theory of NP Completeness. W. H. Freeman.
[10]
Hung, K. and Yum, T. 1992. Fair and Efficient Transmission Scheduling in Multihop Packet Radio Networks. In Proceedings of IEEE GLOBECOM 1992, pp. 6--10, November 1992.
[11]
Khuller, S. and Kim, Y. A. 2004. On Broadcasting in Heterogeneous Networks. In Proceedings of ACM-SIAM SODA '04, pp. 1011--1020, January 2004.
[12]
Leung, K. H. and Kwok, Y. K. 2005. An Efficient and Practical Greedy Algorithm for Server-Peer Selection in Wireless Peer-to-Peer File Sharing Networks. In Lecture Notes in Computer Science, Vol. 3794, pp. 1016--1025, December 2005.
[13]
Ng, T. S. E., Chu, Y. H. S. and Zhang, H. 2003. Measurement- Based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems. In Proceedings of IEEE INFOCOM 2003, Vol. 3, pp. 2199--2209, 30 March -- 3 April 2003.
[14]
Ramaswam, R. and Parhi, K. K. 1989. Distributed Scheduling of Broadcasts in a Radio Network. In Proceedings of IEEE INFOCOM 1989, Vol. 2, pp. 497--504, April 1989.
[15]
Syal, M., Breitbart, Y. and Vingralek, R. 1998. Selection Algorithms for Replicated Web Servers. Reading in ACM SIGMETRICS Performance Evaluation Review, Vol. 26, No. 3, pp. 44--50, December 1998.
[16]
Tsukiyama, S., Ide, M., Shirakawa, I. 1977. A New Algorithm for Generating All the Maximal Independent Sets. SIAM Journal on Computing, Vol. 6, pp. 505--517, 1977.
[17]
Yu, C. W. and Chen, G. H. 1993. Generate All Maximal Independent Sets in Permutation Graphs. International Journal of Computer Mathematics, Vol. 47, pp. 1--8, 1993.
Index Terms
- Efficient content distribution in wireless P2P networks
Recommendations
Bandwidth trading in BitTorrent-like P2P networks for content distribution
Bandwidth trading schemes give peers an incentive to provide upload bandwidth to other peers in a P2P network for fast file distribution. A popular example is the tit-for-tat strategy used in the BitTorrent protocol. Although this game theoretical ...
An efficient overhearing strategy for content distribution in wireless LAN
AINTEC '13: Proceedings of the 9th Asian Internet Engineering ConferenceWhen the same content is simultaneously downloaded by several terminals with unicast in a wireless LAN, the bandwidth must be divided among the terminals and download speed is reduced. With using broadcast nature of wireless media, we propose an ...
How can network coding help P2P content distribution?
ICC'09: Proceedings of the 2009 IEEE international conference on CommunicationsIt is well known that network coding can enhance the performance of Peer-to-Peer (P2P) content distribution systems since it benefits block scheduling. In this paper, we introduce our P2P content distribution system "SmartCode" with sparse network ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
Publisher
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Brussels, Belgium
Publication History
Published: 28 July 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
QShine08
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 113Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in