316 research outputs found
Multiuser Switched Diversity Scheduling Schemes
Multiuser switched-diversity scheduling schemes were recently proposed in
order to overcome the heavy feedback requirements of conventional opportunistic
scheduling schemes by applying a threshold-based, distributed, and ordered
scheduling mechanism. The main idea behind these schemes is that slight
reduction in the prospected multiuser diversity gains is an acceptable
trade-off for great savings in terms of required channel-state-information
feedback messages. In this work, we characterize the achievable rate region of
multiuser switched diversity systems and compare it with the rate region of
full feedback multiuser diversity systems. We propose also a novel proportional
fair multiuser switched-based scheduling scheme and we demonstrate that it can
be optimized using a practical and distributed method to obtain the feedback
thresholds. We finally demonstrate by numerical examples that
switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the
ultimate network capacity of full feedback systems in Rayleigh fading
conditions.Comment: Accepted at IEEE Transactions on Communications, to appear 2012,
funded by NPRP grant 08-577-2-241 from QNR
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
An Analytical Framework for Heterogeneous Partial Feedback Design in Heterogeneous Multicell OFDMA Networks
The inherent heterogeneous structure resulting from user densities and large
scale channel effects motivates heterogeneous partial feedback design in
heterogeneous networks. In such emerging networks, a distributed scheduling
policy which enjoys multiuser diversity as well as maintains fairness among
users is favored for individual user rate enhancement and guarantees. For a
system employing the cumulative distribution function based scheduling, which
satisfies the two above mentioned desired features, we develop an analytical
framework to investigate heterogeneous partial feedback in a general
OFDMA-based heterogeneous multicell employing the best-M partial feedback
strategy. Exact sum rate analysis is first carried out and closed form
expressions are obtained by a novel decomposition of the probability density
function of the selected user's signal-to-interference-plus-noise ratio. To
draw further insight, we perform asymptotic analysis using extreme value theory
to examine the effect of partial feedback on the randomness of multiuser
diversity, show the asymptotic optimality of best-1 feedback, and derive an
asymptotic approximation for the sum rate in order to determine the minimum
required partial feedback.Comment: To appear in IEEE Trans. on Signal Processin
Random Beamforming with Heterogeneous Users and Selective Feedback: Individual Sum Rate and Individual Scaling Laws
This paper investigates three open problems in random beamforming based
communication systems: the scheduling policy with heterogeneous users, the
closed form sum rate, and the randomness of multiuser diversity with selective
feedback. By employing the cumulative distribution function based scheduling
policy, we guarantee fairness among users as well as obtain multiuser diversity
gain in the heterogeneous scenario. Under this scheduling framework, the
individual sum rate, namely the average rate for a given user multiplied by the
number of users, is of interest and analyzed under different feedback schemes.
Firstly, under the full feedback scheme, we derive the closed form individual
sum rate by employing a decomposition of the probability density function of
the selected user's signal-to-interference-plus-noise ratio. This technique is
employed to further obtain a closed form rate approximation with selective
feedback in the spatial dimension. The analysis is also extended to random
beamforming in a wideband OFDMA system with additional selective feedback in
the spectral dimension wherein only the best beams for the best-L resource
blocks are fed back. We utilize extreme value theory to examine the randomness
of multiuser diversity incurred by selective feedback. Finally, by leveraging
the tail equivalence method, the multiplicative effect of selective feedback
and random observations is observed to establish the individual rate scaling.Comment: Submitted in March 2012. To appear in IEEE Transactions on Wireless
Communications. Part of this paper builds upon the following letter: Y. Huang
and B. D. Rao, "Closed form sum rate of random beamforming", IEEE Commun.
Lett., vol. 16, no. 5, pp. 630-633, May 201
Joint Channel Probing and Proportional Fair Scheduling in Wireless Networks
The design of a scheduling scheme is crucial for the efficiency and
user-fairness of wireless networks. Assuming that the quality of all user
channels is available to a central controller, a simple scheme which maximizes
the utility function defined as the sum logarithm throughput of all users has
been shown to guarantee proportional fairness. However, to acquire the channel
quality information may consume substantial amount of resources. In this work,
it is assumed that probing the quality of each user's channel takes a fraction
of the coherence time, so that the amount of time for data transmission is
reduced. The multiuser diversity gain does not always increase as the number of
users increases. In case the statistics of the channel quality is available to
the controller, the problem of sequential channel probing for user scheduling
is formulated as an optimal stopping time problem. A joint channel probing and
proportional fair scheduling scheme is developed. This scheme is extended to
the case where the channel statistics are not available to the controller, in
which case a joint learning, probing and scheduling scheme is designed by
studying a generalized bandit problem. Numerical results demonstrate that the
proposed scheduling schemes can provide significant gain over existing schemes.Comment: 26 pages, 8 figure
Active Queue Management for Fair Resource Allocation in Wireless Networks
This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users
- …