5,977 research outputs found
Scheduling for next generation WLANs: filling the gap between offered and observed data rates
In wireless networks, opportunistic scheduling is used to increase system throughput by exploiting multi-user diversity. Although recent advances have increased physical layer data rates supported in wireless local area networks (WLANs), actual throughput realized are significantly lower due to overhead. Accordingly, the frame aggregation concept is used in next generation WLANs to improve efficiency. However, with frame aggregation, traditional opportunistic schemes are no longer optimal. In this paper, we propose schedulers that take queue and channel conditions into account jointly, to maximize throughput observed at the users for next generation WLANs. We also extend this work to design two schedulers that perform block scheduling for maximizing network throughput over multiple transmission sequences. For these schedulers, which make decisions over long time durations, we model the system using queueing theory and determine users' temporal access proportions according to this model. Through detailed simulations, we show that all our proposed algorithms offer significant throughput improvement, better fairness, and much lower delay compared with traditional opportunistic schedulers, facilitating the practical use of the evolving standard for next generation wireless networks
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
Queueing analysis of opportunistic scheduling with spatially correlated channels
International audienc
Exploiting Spatial Interference Alignment and Opportunistic Scheduling in the Downlink of Interference Limited Systems
In this paper we analyze the performance of single stream and multi-stream
spatial multiplexing (SM) systems employing opportunistic scheduling in the
presence of interference. In the proposed downlink framework, every active user
reports the post-processing signal-to-interference-plus-noise-power-ratio
(post-SINR) or the receiver specific mutual information (MI) to its own
transmitter using a feedback channel. The combination of scheduling and
multi-antenna receiver processing leads to substantial interference suppression
gain. Specifically, we show that opportunistic scheduling exploits spatial
interference alignment (SIA) property inherent to a multi-user system for
effective interference mitigation. We obtain bounds for the outage probability
and the sum outage capacity for single stream and multi stream SM employing
real or complex encoding for a symmetric interference channel model.
The techniques considered in this paper are optimal in different operating
regimes. We show that the sum outage capacity can be maximized by reducing the
SM rate to a value less than the maximum allowed value. The optimum SM rate
depends on the number of interferers and the number of available active users.
In particular, we show that the generalized multi-user SM (MU SM) method
employing real-valued encoding provides a performance that is either
comparable, or significantly higher than that of MU SM employing complex
encoding. A combination of analysis and simulation is used to describe the
trade-off between the multiplexing rate and sum outage capacity for different
antenna configurations
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
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
- …