989 research outputs found
Advanced Radio Resource Management for Multi Antenna Packet Radio Systems
In this paper, we propose fairness-oriented packet scheduling (PS) schemes
with power-efficient control mechanism for future packet radio systems. In
general, the radio resource management functionality plays an important role in
new OFDMA based networks. The control of the network resource division among
the users is performed by packet scheduling functionality based on maximizing
cell coverage and capacity satisfying, and certain quality of service
requirements. Moreover, multiantenna transmit-receive schemes provide
additional flexibility to packet scheduler functionality. In order to mitigate
inter-cell and co-channel interference problems in OFDMA cellular networks soft
frequency reuse with different power masks patterns is used. Stemming from the
earlier enhanced proportional fair scheduler studies for single-input
multiple-output (SIMO) and multiple-input multipleoutput (MIMO) systems, we
extend the development of efficient packet scheduling algorithms by adding
transmit power considerations in the overall priority metrics calculations and
scheduling decisions. Furthermore, we evaluate the proposed scheduling schemes
by simulating practical orthogonal frequency division multiple access (OFDMA)
based packet radio system in terms of throughput, coverage and fairness
distribution among users. As a concrete example, under reduced overall transmit
power constraint and unequal power distribution for different sub-bands, we
demonstrate that by using the proposed power-aware multi-user scheduling
schemes, significant coverage and fairness improvements in the order of 70% and
20%, respectively, can be obtained, at the expense of average throughput loss
of only 15%.Comment: 14 Pages, IJWM
Scheduling Policies in Time and Frequency Domains for LTE Downlink Channel: A Performance Comparison
A key feature of the Long-Term Evolution (LTE) system is that the packet scheduler can make use of the channel quality information (CQI), which is periodically reported by user equipment either in an aggregate form for the whole downlink channel or distinguished for each available subchannel. This mechanism allows for wide discretion in resource allocation, thus promoting the flourishing of several scheduling algorithms, with different purposes. It is therefore of great interest to compare the performance of such algorithms under different scenarios. Here, we carry out a thorough performance analysis of different scheduling algorithms for saturated User Datagram Protocol (UDP) and Transmission Control Protocol (TCP) traffic sources, as well as consider both the time- and frequency-domain versions of the schedulers and for both flat and frequency-selective channels. The analysis makes it possible to appreciate the difference among the scheduling algorithms and to assess the performance gain, in terms of cell capacity, users' fairness, and packet service time, obtained by exploiting the richer, but heavier, information carried by subchannel CQI. An important part of this analysis is a throughput guarantee scheduler, which we propose in this paper. The analysis reveals that the proposed scheduler provides a good tradeoff between cell capacity and fairness both for TCP and UDP traffic sources
Analytical Model of Proportional Fair Scheduling in Interference-limited OFDMA/LTE Networks
Various system tasks like interference coordination, handover decisions,
admission control etc. in upcoming cellular networks require precise mid-term
(spanning over a few seconds) performance models. Due to channel-dependent
scheduling at the base station, these performance models are not simple to
obtain. Furthermore, upcoming cellular systems will be interference-limited,
hence, the way interference is modeled is crucial for the accuracy. In this
paper we present an analytical model for the SINR distribution of the
\textit{scheduled} subcarriers of an OFDMA system with proportional fair
scheduling. The model takes the precise SINR distribution into account. We
furthermore refine our model with respect to uniform modulation and coding, as
applied in LTE networks. The derived models are validated by means of
simulations. In additon, we show that our models are approximate estimators for
the performance of rate-based proportional fair scheduling, while they
outperform some simpler prediction models from related work significantly.Comment: 7 pages, 6 figures. This work has been submitted to the IEEE for
possible publication. Copyright may be transferred without notice, after
which this version may no longer be accessibl
- âŠ