Abstract

In the recent years, the peer-to-peer (P2P) overlay network has been a promising architecture for multimedia streaming services besides its common use for efficient file sharing. By simply increasing the number of peers, the P2P overlay network can meet the high bit rate requirements of multimedia applications. Optimal peer selection for newly joining peers is one of the important problems, especially in wireless networks which have limited resources and capacity, since the peer selection process has a direct impact on the throughput of the underlay network and the co-existing unicast traffic. In this paper we tackle the problem of peer selection for streaming applications over wireless ad hoc networks. We devise a novel peer selection algorithm which maximizes the throughput of the underlay network, and at the same time makes P2P streaming friendly towards the co-existing data traffic. The proposed receiver based rate allocation and peer selection (RPS) algorithm is derived using the network utility maximization (NUM) framework. The algorithm solves the peer selection and rate allocation problem distributedly while optimally adapting the medium access control (MAC) layer parameters and is easily extensible to large P2P networks. Simulation results show that by using the proper price exchange mechanism, the peer receivers can effectively maximize the throughput of the underlay network by intelligently selecting its source peers.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.