Sum-rate maximising in cognitive MIMO ad-hoc networks using weighted MMSE approach

This reported work focuses on weighted sum-rate maximisation (WSRM) of cognitive radio ad-hoc networks, where a K user multiple-input multiple-output interference network ( K- MIMO-IFN) uses the same spectrum with a licenced primary user. Because the WSRM problem in K- MIMO-IFN is non-convex and it is difficult to get an optimal solution directly, the weighted minimum mean square error (MMSE) approach is used to make the problem easier to handle. This report then proposes a dual-MMSE-algorithm, which iteratively finds a local optimal solution and only needs the local channel knowledge. Simulation results show that the proposed algorithm outperforms other conventional algorithms.

[1]  D. Bertsekas On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[2]  Kyoung-Jae Lee,et al.  MMSE Based Block Diagonalization for Cognitive Radio MIMO Broadcast Channels , 2011, IEEE Transactions on Wireless Communications.

[3]  John M. Cioffi,et al.  Joint Tx-Rx beamforming design for multicarrier MIMO channels: a unified framework for convex optimization , 2003, IEEE Trans. Signal Process..

[4]  Sriram Vishwanath,et al.  On the Capacity of a Class of MIMO Cognitive Radios , 2007, IEEE Journal of Selected Topics in Signal Processing.

[5]  Ying-Chang Liang,et al.  Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks , 2007, IEEE Journal of Selected Topics in Signal Processing.

[6]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[7]  Chris T. K. Ng,et al.  Linear Precoding in Cooperative MIMO Cellular Networks with Limited Coordination Clusters , 2010, IEEE Journal on Selected Areas in Communications.