상세정보
학술대회
Throughput Penalty of Fair Scheduling Algorithms on Multiple Antenna Broadcast Channels
- 저자
- 이주열
- 발행일
- 201207
- 출처
- International Symposium on Information Theory (ISIT) 2012, pp.2496-2500
- 협약과제
- 12PI1200, 스마트 모바일 서비스의 체감 품질 향상을 위한 무선 전송 원천기술 연구, 이승환
- 초록
- Fairness consideration in the wireless resource scheduling is important for enhancing the quality of user experience, despite the consequent throughput loss. This paper analyzes the associated penalty in obtaining a certain fairness criteria for multiple antenna broadcast channels. We define a fairness penalty as the achievable sum-rate difference in the regime of high SNR. We show that the penalty for the max-product fair scheduling criterion is negligible and derive the penalty for the max-min fair scheduling criterion. We analyze ergodic behaviors for the Rayleigh-fading channel both when the average SNRs are homogeneous (identical) and when the SNRs are heterogeneous (different). For the homogeneous case, it is shown that the penalty diminishes as the number of transmit antennas increases. For the heterogeneous case, there is an inevitable bias term which is associated with the users' SNR distribution. © 2012 IEEE.
- KSP 제안 키워드
- Bias term, Broadcast Channel, Fair Scheduling, Max-min fair, Quality of user experience, Scheduling algorithm, Throughput loss, achievable sum rate, fading channel, high SNR, multiple antennas