11,272 research outputs found
Opportunistic Scheduling and Beamforming for MIMO-OFDMA Downlink Systems with Reduced Feedback
Opportunistic scheduling and beamforming schemes with reduced feedback are
proposed for MIMO-OFDMA downlink systems. Unlike the conventional beamforming
schemes in which beamforming is implemented solely by the base station (BS) in
a per-subcarrier fashion, the proposed schemes take advantages of a novel
channel decomposition technique to perform beamforming jointly by the BS and
the mobile terminal (MT). The resulting beamforming schemes allow the BS to
employ only {\em one} beamforming matrix (BFM) to form beams for {\em all}
subcarriers while each MT completes the beamforming task for each subcarrier
locally. Consequently, for a MIMO-OFDMA system with subcarriers, the
proposed opportunistic scheduling and beamforming schemes require only one BFM
index and supportable throughputs to be returned from each MT to the BS, in
contrast to BFM indices and supportable throughputs required by the
conventional schemes. The advantage of the proposed schemes becomes more
evident when a further feedback reduction is achieved by grouping adjacent
subcarriers into exclusive clusters and returning only cluster information from
each MT. Theoretical analysis and computer simulation confirm the effectiveness
of the proposed reduced-feedback schemes.Comment: Proceedings of the 2008 IEEE International Conference on
Communications, Beijing, May 19-23, 200
Proportional fair scheduling with reduced feedback
An opportunistic feedback technique is proposed for proportional fair (PF) scheduling in a downlink multi-user system. This technique requires each mobile station, the scheduling metric of which is higher than a threshold, to send one-bit feedback for PF scheduling. The scheduler determines the optimal modulation and coding scheme for a scheduled user based on channel quality indicator (CQI) update, which is sent on a longer period than the scheduling period. The simulation results indicate that PF scheduling with the proposed update scheme can achieve similar performance as PF scheduling with full CQI feedback. The feedback overhead can be reduced in comparison with typical PF scheduling provided that an optimal CQI update period is chosen. © The Institution of Engineering and Technology 2009
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
Autonomous Algorithms for Centralized and Distributed Interference Coordination: A Virtual Layer Based Approach
Interference mitigation techniques are essential for improving the
performance of interference limited wireless networks. In this paper, we
introduce novel interference mitigation schemes for wireless cellular networks
with space division multiple access (SDMA). The schemes are based on a virtual
layer that captures and simplifies the complicated interference situation in
the network and that is used for power control. We show how optimization in
this virtual layer generates gradually adapting power control settings that
lead to autonomous interference minimization. Thereby, the granularity of
control ranges from controlling frequency sub-band power via controlling the
power on a per-beam basis, to a granularity of only enforcing average power
constraints per beam. In conjunction with suitable short-term scheduling, our
algorithms gradually steer the network towards a higher utility. We use
extensive system-level simulations to compare three distributed algorithms and
evaluate their applicability for different user mobility assumptions. In
particular, it turns out that larger gains can be achieved by imposing average
power constraints and allowing opportunistic scheduling instantaneously, rather
than controlling the power in a strict way. Furthermore, we introduce a
centralized algorithm, which directly solves the underlying optimization and
shows fast convergence, as a performance benchmark for the distributed
solutions. Moreover, we investigate the deviation from global optimality by
comparing to a branch-and-bound-based solution.Comment: revised versio
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
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in
the limit of a large number of nodes. A random connections model is assumed in
which the channel connections between the nodes are drawn independently from a
common distribution. Transmitting nodes are subject to an on-off strategy, and
receiving nodes employ conventional single-user decoding. The following results
are proven:
1) For a class of connection models with finite mean and variance, the
throughput scaling is upper-bounded by for single-hop schemes, and
for two-hop (and multihop) schemes.
2) The throughput scaling is achievable for a specific
connection model by a two-hop opportunistic relaying scheme, which employs
full, but only local channel state information (CSI) at the receivers, and
partial CSI at the transmitters.
3) By relaxing the constraints of finite mean and variance of the connection
model, linear throughput scaling is achievable with Pareto-type
fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information
Theor
Space Division Multiple Access with a Sum Feedback Rate Constraint
On a multi-antenna broadcast channel, simultaneous transmission to multiple
users by joint beamforming and scheduling is capable of achieving high
throughput, which grows double logarithmically with the number of users. The
sum rate for channel state information (CSI) feedback, however, increases
linearly with the number of users, reducing the effective uplink capacity. To
address this problem, a novel space division multiple access (SDMA) design is
proposed, where the sum feedback rate is upper-bounded by a constant. This
design consists of algorithms for CSI quantization, threshold based CSI
feedback, and joint beamforming and scheduling. The key feature of the proposed
approach is the use of feedback thresholds to select feedback users with large
channel gains and small CSI quantization errors such that the sum feedback rate
constraint is satisfied. Despite this constraint, the proposed SDMA design is
shown to achieve a sum capacity growth rate close to the optimal one. Moreover,
the feedback overflow probability for this design is found to decrease
exponentially with the difference between the allowable and the average sum
feedback rates. Numerical results show that the proposed SDMA design is capable
of attaining higher sum capacities than existing ones, even though the sum
feedback rate is bounded.Comment: 29 pages; submitted to IEEE Transactions on Signal Processin
- …