Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

Partner Assignment Algorithm for Cooperative Diversity in mobile communication systems

이동통신 시스템에서 Cooperative Diversity를 위한 Partner Assignment Algorithm

  • Jung, Young-Seok (School of Electrical Engineering and Computer Science and INMC Seoul National University) ;
  • Lee, Jae-Hong (School of Electrical Engineering and Computer Science and INMC Seoul National University)
  • 정영석 (서울대학교 전기컴퓨터공학부 뉴미디어통신공동연구소) ;
  • 이재홍 (서울대학교 전기컴퓨터공학부 뉴미디어통신공동연구소)
  • Published : 2006.06.21
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords