Cooperative Beamforming Design for MIMO Multiuser Networks

We consider a cooperative beamforming design problem for multiple-input multiple-output multiuser networks by applying the cooperative bargaining theory. The gradient method for Nash bargaining solutions includes complicate matrix computation leading to impractical. In this paper, we introduce the Kalai-Smorodinsky solution which can be simply implemented by convex optimization algorithms. In addition, we propose low complexity suboptimal user selection algorithm to maximize the achievable sum rate.

[1]  N.D. Sidiropoulos,et al.  On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm , 2005, IEEE Transactions on Signal Processing.

[2]  Eduard A. Jorswieck,et al.  Beamforming in underlay cognitive radio: Null-shaping constraints and greedy user selection , 2010, 2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications.

[3]  Hyundong Shin,et al.  Noncooperative Beamforming Game on MIMO Networks , 2010 .

[4]  Hyundong Shin,et al.  Beamforming optimization for multiuser two-tier networks , 2011, Journal of Communications and Networks.

[5]  E. Kalai,et al.  OTHER SOLUTIONS TO NASH'S BARGAINING PROBLEM , 1975 .