Node Selection in P2P Content Sharing Service in Mobile Cellular Networks with Reduction Bandwidth

The peer-to-peer service has entered the public limelight over the last few years. Several research projects are underway on peer-to-peer technologies, but no definitive conclusion is currently available. Comparing to traditional server-client technology on the internet, the P2P technology has capabilities to realize highly scalable, extensible and efficient distributed applications. At the same time mobile networks such as WAP, wireless LAN and Bluetooth have been developing at breakneck speed. Demand for using peer-to-peer applications over PDAs and cellular phones is increasing. The purpose of this study is to explore a mobile peer-to-peer network architecture where a variety of devices communications each other over a variety of networks. Mobility in Peer-to-Peer (P2P) networking has become a popular research area in recent years. One of the new ideas has been how P2P would suit for cellular networks. In this case, Mobile Peer-to-Peer (MP2P) presents not only technical but also business and legal challenges.we propose the architecture well-adapted to mobile devices and mobile network. In P2P content sharing service in mobile cellular networks, the bottleneck of file transfer speed is usually the downlink bandwidth of the receiver rather than the uplink bandwidth of the senders. In this paper we consider the impact of reduction bandwidth on file transfer speed and propose two novel peer selection algorithms named DBaT-B and DBaT-N, which are designed for two different cases of the requesting peer’s demand respectively. Our algorithms take the requesting peer’s reduction bandwidth as the target of the sum of the selected peers’ uplink bandwidth. To ensure load balance on cells, they will first choose a cell with the lowest traffic load before choosing each peer.