Bandwidth allocation for cooperative relay networks based on Nash bargaining solution

Abstract

This paper is concerned with the bandwidth allocation problem for cooperative relay networks. The relay takes the roles of not only forwarding the data originated from the users but also of transmitting its own data to the access point. We focus on the interesting questions of when and how the users and the relay can both benefit from the cooperation by bandwidth allocation for relaying among the users. The bandwidth allocation problem is formulated in this paper as a Nash bargaining problem, and then the bandwidth allocation algorithm can be given on the basis of the sub-gradient method. Simulation results illustrate that users and the relay can both obtain more profits through cooperation. Copyright ©2011 John Wiley & Sons, Ltd. Copyright © 2011 John Wiley & Sons, Ltd.