4,696 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
A General Class of Throughput Optimal Routing Policies in Multi-hop Wireless Networks
This paper considers the problem of throughput optimal routing/scheduling in
a multi-hop constrained queueing network with random connectivity whose special
case includes opportunistic multi-hop wireless networks and input-queued switch
fabrics. The main challenge in the design of throughput optimal routing
policies is closely related to identifying appropriate and universal Lyapunov
functions with negative expected drift. The few well-known throughput optimal
policies in the literature are constructed using simple quadratic or
exponential Lyapunov functions of the queue backlogs and as such they seek to
balance the queue backlogs across network independent of the topology. By
considering a class of continuous, differentiable, and piece-wise quadratic
Lyapunov functions, this paper provides a large class of throughput optimal
routing policies. The proposed class of Lyapunov functions allow for the
routing policy to control the traffic along short paths for a large portion of
state-space while ensuring a negative expected drift. This structure enables
the design of a large class of routing policies. In particular, and in addition
to recovering the throughput optimality of the well known backpressure routing
policy, an opportunistic routing policy with congestion diversity is proved to
be throughput optimal.Comment: 31 pages (one column), 8 figures, (revision submitted to IEEE
Transactions on Information Theory
Performance Analysis of Heterogeneous Feedback Design in an OFDMA Downlink with Partial and Imperfect Feedback
Current OFDMA systems group resource blocks into subband to form the basic
feedback unit. Homogeneous feedback design with a common subband size is not
aware of the heterogeneous channel statistics among users. Under a general
correlated channel model, we demonstrate the gain of matching the subband size
to the underlying channel statistics motivating heterogeneous feedback design
with different subband sizes and feedback resources across clusters of users.
Employing the best-M partial feedback strategy, users with smaller subband size
would convey more partial feedback to match the frequency selectivity. In order
to develop an analytical framework to investigate the impact of partial
feedback and potential imperfections, we leverage the multi-cluster subband
fading model. The perfect feedback scenario is thoroughly analyzed, and the
closed form expression for the average sum rate is derived for the
heterogeneous partial feedback system. We proceed to examine the effect of
imperfections due to channel estimation error and feedback delay, which leads
to additional consideration of system outage. Two transmission strategies: the
fix rate and the variable rate, are considered for the outage analysis. We also
investigate how to adapt to the imperfections in order to maximize the average
goodput under heterogeneous partial feedback.Comment: To appear in IEEE Trans. on Signal Processin
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
- …