Multi-user symmetric cooperation based on nash bargaining solution in cooperative relay networks

  • Authors:
  • Kai Ma;Xin-Ping Guan;Juan Wang;Xiao-Min Wei

  • Affiliations:
  • Key Laboratory of Industrial Computer Control Engineering of Hebei Province, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004;Key Laboratory of Industrial Computer Control Engineering of Hebei Province, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004 and School of Electronics, Information ...;Key Laboratory of Industrial Computer Control Engineering of Hebei Province, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004;Key Laboratory of Industrial Computer Control Engineering of Hebei Province, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004

  • Venue:
  • International Journal of Automation and Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.