Efficient content distribution in wireless P2P networks

Authors:
Qiong Sun;Victor O. K. Li;Ka-Cheong Leung
Affiliations:
The University of Hong Kong, Hong Kong, China;The University of Hong Kong, Hong Kong, China;The University of Hong Kong, Hong Kong, China
Venue:
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Year:
2008

Citing 7
Cited 0

Selection algorithms for replicated Web servers

ACM SIGMETRICS Performance Evaluation Review
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient collective communication in distributed heterogeneous systems

Journal of Parallel and Distributed Computing
On broadcasting in heterogenous networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient and practical greedy algorithm for server-peer selection in wireless peer-to-peer file sharing networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Cooperative content distribution: scalability through self-organization

Self-star Properties in Complex Information Systems
Performance comparison of scheduling algorithms for peer-to-peer collaborative file distribution

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.