Efficient content distribution in wireless P2P networks

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.