Scheduling Algorithm Considering HARQ and Successive Interference Cancellation
In this paper, scheduling algorithm for CDMA uplink considering the performances of HARQ and successive interference cancellation (SIC) is studied. It is assumed that channel attenuation due to near-far effect is not informed to receiver and all the users request the same QoS. The purpose of this st...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, scheduling algorithm for CDMA uplink considering the performances of HARQ and successive interference cancellation (SIC) is studied. It is assumed that channel attenuation due to near-far effect is not informed to receiver and all the users request the same QoS. The purpose of this study is to increase link throughput without fairness violation, and the goal is approached by raising early termination. We show that the effective SINR which determines the probability of error free decoding is highly correlated with the amount of first subpackets received at the same time, and we also show that the overall PER is given as a function of first subpacket 's distribution. We build PER as a function of the subpacket's flow, and by simple analysis and simulation, we show that the probability of early termination can be greatly increased through subpacket flow control, while the PLR remains almost constant. We find the optimal distribution which maximizes an early termination and design a scheduling rule which satisfies the proportional fairness between the users. Simulation results show that proposed algorithm achieves large throughput enhancement without fairness violation. |
---|---|
ISSN: | 2161-9646 |
DOI: | 10.1109/WICOM.2007.714 |