Novel bandwidth strategy for wireless P2P file sharing

With the rapid development of the mobile device technology and wireless network technology, the need of an efficient file sharing method on wireless network becomes more and more significant. Peer-to-Peer(P2P) file distribution, as a quite popular method being used now, is a promising choice. However, the limitation of bandwidth of wireless networks greatly restricts the performance of wireless P2P. In this paper, we propose a new idea of better utilizing the limited bandwidth to improve the file distribution performance. The criteria of an optimal splitting of the half-duplex bandwidth is deduced with mathematical analysis. To achieve a further improvement on the average distribution time, we also propose a grouping strategy which works with the bandwidth strategy. Simulation results show that our mechanism can efficiently reduce the file distribution time among wireless peers. © 2011 IEEE.published_or_final_versionThe 2011 IEEE Wireless Communications and Networking Conference (WCNC), Cancun, Mexico, 28-31 March 2011. In IEEE Wireless Communications and Networking Conference Proceedings, 2011, p. 2161-216

A novel grouping strategy for reducing average distribution time in P2P file sharing

Peer-to-Peer(P2P) file distribution has been widely used for file sharing in recent years. When compared with the traditional client-server model, the P2P model is a lot more efficient as each user can act as both a client and a server. This enables the P2P file distribution to scale well with increasing number of users. Grouping strategy has been introduced to reduce the average distribution time among peers without prolonging the total time needed to obtain a file. In this paper, a novel grouping strategy which groups peers of similar bandwidth together is introduced. We mathematically illustrate that under certain circumstances, this new grouping strategy performs better than the Greedy Grouping mechanism. To understand the performance of our grouping mechanism more comprehensively, we conduct extensive simulations. The results show that our mechanism can enhance the performance significantly in different network settings. ©2010 IEEE.published_or_final_versionThe 2010 IEEE International Conference on Communications (ICC), Cape Town, South Africa, 1-5 May 2010. In IEEE International Conference on Communications, 201

Improving file distribution performance by grouping in peer-to-peer networks

It has been shown that the peer-to-peer paradigm is more efficient than the traditional client-server model for file sharing among a large number of users. Given a group of leechers who wants to download a single file and a group of seeds who possesses the whole file, the minimum time needed for distributing the file to all users can be calculated based on their bandwidth availabilities. A scheduling algorithm has been developed so that every leecher can obtain the file within this minimum time. Unfortunately, this mechanism is not optimal with regard to the average download time among the peers. In this paper, we study how to reduce the average download time without prolonging the time needed for all leechers to obtain the file from a theoretical perspective. Based on the bandwidth capacities, the seeds and leechers are divided into different groups. We identify the necessary conditions for grouping to bring about benefits. We also study the impact on performance when leechers leave the system before the downloading process is complete. To evaluate our mechanism, we conduct extensive simulations and compare the performance with a BitTorrentlike file sharing algorithm. The results show that our grouping protocol successfully reduces the average download time over a wide range of system configurations. © 2009 IEEE.published_or_final_versio