Partner Assignment Algorithm for Cooperative Diversity in Mobile Communication Systems

Most work on cooperative diversity has assumed that the cooperating group (source and partners) and the associated average channel conditions between terminals (source, partners, and destination) are predetermined. In practical situations, however, it is important to develop the efficient algorithms for assigning the terminals with good inter-user channels for cooperating groups. In this paper, we propose the partner assignment algorithm for cooperative diversity in mobile communication systems. The proposed partner assignment algorithm is investigated by using the path loss model for mobile communication systems. Numerical results show that the proposed partner assignment algorithm provides the comparable probability of cooperative transmission to the partner assignment algorithm using exhaustive search. The probability of cooperative transmission increases with the number of users, which gives potential benefits of practical implementation to user cooperation in mobile communication systems. The proposed partner assignment algorithm also provides the tradeoff between probability of cooperative transmission, cooperative diversity gain, and the amount of average SNR information of inter-user channels

[1]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[2]  J. Galambos,et al.  Products of Random Variables: Applications to Problems of Physics and to Arithmetical Functions , 2004 .

[3]  Aria Nosratinia,et al.  Coded cooperation in wireless communications: space-time transmission and iterative decoding , 2004, IEEE Transactions on Signal Processing.

[4]  Matthew C. Valenti,et al.  Practical relay networks: a generalization of hybrid-ARQ , 2005 .

[5]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[6]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

[7]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[8]  Elza Erkip,et al.  Cooperative coding for wireless networks , 2004, IEEE Trans. Commun..

[9]  Aria Nosratinia,et al.  Cooperative communication in wireless networks , 2004, IEEE Communications Magazine.

[10]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[11]  Hesham El Gamal,et al.  Distributed space-time filtering for cooperative wireless networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[12]  Aria Nosratinia,et al.  Distributed protocols for user cooperation in multi-user wireless networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[13]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[14]  Aria Nosratinia,et al.  Cooperation diversity through coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[15]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

[16]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .