Rate selection analysis under semi-persistent scheduling in LTE networks

Abstract

Abstract-Upcoming LTE networks have basically two different modes for scheduling data in the down-link by the base station. Dynamic scheduling brings the advantage of exploiting instantaneous channel state information while it puts on the other hand a significant burden on the system in terms of overhead and computation requirements. Especially for small packets that show up periodically, the overhead is typically too high. Therefore, the base station can serve such packet flows by the semi-persistent scheduling mode. In this mode, a certain resource allocation is fixed to a periodic schedule. While this does not allow any longer to exploit instantaneous channel states, it requires much less overhead. In this paper, we address the problem of selecting a modulation and coding scheme for such semi-persistent scheduling grants. The problem lies here in the stochastic characterization of the resource blocks over the next few seconds while on the other hand estimating based on such a characterization the blok error rate (and hence the average goodput). We provide a novel scheme, which outperforms all previously presented schemes significantly. The underlying model that we provide can also be used for any other long-term decision in an LTE system with semi-persistent scheduling such as interference coordination, handover decision etc.

Analytical Model of Proportional Fair Scheduling in Interference-Limited OFDMA/LTE Networks

“…Therein Ei denotes the exponential integral. Equation (7) is also referred to as static SINR estimation in case RB n is persistently assigned to UE j [19]. Then, following rules of random variable transformation [20] the distribution function F Xj,n (x) and the PDF f Xj,n (x) of the random variable X j,n = Xj,n E[Xj,n] representing the scaled SINR can be calculated:…”

Throughput Analysis of Proportional Fair Scheduling for Sparse and Ultra-Dense Interference-Limited OFDMA/LTE Networks

“…The latter is out of the scope in our analysis. In our previous publication [19] we have shown that the minimum SINR is a good approximation of EESM method. Especially, for small sets of resource blocks this approximation is plausible as the likelihood of scheduling large sets of resource blocks is relatively small.…”

Generalized performance analysis and optimization of enhanced power saving semi persistent scheduler

“…exponential random variables with mean µ k that is uniformly distributed over a closed interval [a, b]. However, the mean SNR is known to remain constant in time for at least few seconds [25].…”