Multi-user Symmetric Cooperation Based on Nash Bargaining Solution in Cooperative Relay Networks

This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allocation solution is obtained by Nash bargaining solution （NBS）. Moreover, we also consider the implementations of the cooperation strategy, i.e., the grouping and admission control algorithm. Simulation results show that users can obtain larger rates under the symmetric cooperation strategy than the non-cooperative case.