In commercial networks, user nodes operating on batteries are assumed to be selfish to consume their resources （i.e., bandwidth and power） solely maximizing their own benefits （e.g., the received signal-to-noise ratios （SNRs） and datarates）. In this paper, a cooperative game theoretical framework is proposed to jointly perform the bandwidth and power allocation for selfish cooperative relay networks. To ensure a fair and efficient resource sharing between two selfish user nodes, we assume that either node can act as a source as well as a potential relay for each other and either node is willing to seek cooperative relaying only if the datarate achieved through cooperation is not lower than that achieved through noncooperation （i.e., direct transmission） by consuming the same amount of bandwidth and power resource. Define the cooperative strategy of a node as the number of bandwidth and power that it is willing to contribute for relaying purpose. The two node joint bandwidth and power allocation （JBPA） problem can then be formulated as a cooperative game. Since the Nash bargaining solution （NBS） to the JBPA game （JBPAG） is computationally difficult to obtain, we divide it into two subgames, i.e., the bandwidth allocation game （BAG） and the power allocation game （PAG）. We prove that both the subgames have unique NBS. And then the suboptimal NBS to the JBPAG can be achieved by solving the BAG and PAG sequentially. Simulation results show that the proposed cooperative game scheme is efficient in that the performance loss of the NBS result to that of the maximal overall data-rate scheme is small while the maximal-rate scheme is unfair. The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance.
展开▼
