| |
| In wireless communication networks, the cooperative communication performance depends on careful resource allocation. This paper considers the problem of resource sharing among selfish nodes in wireless cooperative networks. In the system, each node can act as a source as well as a potential relay, and both nodes are willing to achieve an extra rate increase by jointly adjusting their channel bandwidth and power levels for cooperative relaying. First, a two-user algorithm is proposed to bargain joint bandwidth and power allocation(JBPA) between two users. Then a multiuser bargaining algorithm is developed based on the Hungarian method. NBS is applied to formulate the JBPA problem to guarantee fairness. And, the optimal coalitions are formed by using the Hungarian method, such that the overall network rate increase is also maximized for multiple users. Simulation results indicate the Nash bargaining solution(NBS) resource sharing is fair and the fairness of resource allocation only depends on how much contribution its partner can make to its rate increase. Meanwhile, the proposed algorithm has fast convergence to the optimum and the multiuser bargaining algorithm can guarantee fairness between cooperative partner, but also maximize the overall network rate increase. |
|
| Keywords:Relay selection, bandwidth allocation, power control, Nash bargaining solution. |
|
