5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness

Research Article

Efficient Content Distribution in Wireless P2P Networks

Download472 downloads
  • @INPROCEEDINGS{10.4108/ICST.QSHINE2008.3964,
        author={Qiong Sun and Victor O. K. Li and Ka-Cheong Leung},
        title={Efficient Content Distribution in Wireless P2P Networks},
        proceedings={5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness},
        publisher={ICST},
        proceedings_a={QSHINE},
        year={2010},
        month={5},
        keywords={Broadcasting Content distribution Peer-to-peer.},
        doi={10.4108/ICST.QSHINE2008.3964}
    }
    
  • Qiong Sun
    Victor O. K. Li
    Ka-Cheong Leung
    Year: 2010
    Efficient Content Distribution in Wireless P2P Networks
    QSHINE
    ICST
    DOI: 10.4108/ICST.QSHINE2008.3964
Qiong Sun1,*, Victor O. K. Li1,*, Ka-Cheong Leung1,*
  • 1: Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong, China
*Contact email: joansun@eee.hku.hk, vli@eee.hku.hk, kcleung@eee.hku.hk

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.