210 research outputs found
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
Distributed Linear Precoding and User Selection in Coordinated Multicell Systems
In this manuscript we tackle the problem of semi-distributed user selection
with distributed linear precoding for sum rate maximization in multiuser
multicell systems. A set of adjacent base stations (BS) form a cluster in order
to perform coordinated transmission to cell-edge users, and coordination is
carried out through a central processing unit (CU). However, the message
exchange between BSs and the CU is limited to scheduling control signaling and
no user data or channel state information (CSI) exchange is allowed. In the
considered multicell coordinated approach, each BS has its own set of cell-edge
users and transmits only to one intended user while interference to
non-intended users at other BSs is suppressed by signal steering (precoding).
We use two distributed linear precoding schemes, Distributed Zero Forcing (DZF)
and Distributed Virtual Signal-to-Interference-plus-Noise Ratio (DVSINR).
Considering multiple users per cell and the backhaul limitations, the BSs rely
on local CSI to solve the user selection problem. First we investigate how the
signal-to-noise-ratio (SNR) regime and the number of antennas at the BSs affect
the effective channel gain (the magnitude of the channels after precoding) and
its relationship with multiuser diversity. Considering that user selection must
be based on the type of implemented precoding, we develop metrics of
compatibility (estimations of the effective channel gains) that can be computed
from local CSI at each BS and reported to the CU for scheduling decisions.
Based on such metrics, we design user selection algorithms that can find a set
of users that potentially maximizes the sum rate. Numerical results show the
effectiveness of the proposed metrics and algorithms for different
configurations of users and antennas at the base stations.Comment: 12 pages, 6 figure
Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes
A network of wireless communication links is considered in a Rayleigh
fading environment. It is assumed that each link can be active and transmit
with a constant power or remain silent. The objective is to maximize the
number of active links such that each active link can transmit with a constant
rate . An upper bound is derived that shows the number of active links
scales at most like . To obtain a lower bound, a
decentralized link activation strategy is described and analyzed. It is shown
that for small values of , the number of supported links by this
strategy meets the upper bound; however, as grows, this number
becomes far below the upper bound. To shrink the gap between the upper bound
and the achievability result, a modified link activation strategy is proposed
and analyzed based on some results from random graph theory. It is shown that
this modified strategy performs very close to the optimum. Specifically, this
strategy is \emph{asymptotically almost surely} optimum when
approaches or 0. It turns out the optimality results are obtained in
an interference-limited regime. It is demonstrated that, by proper selection of
the algorithm parameters, the proposed scheme also allows the network to
operate in a noise-limited regime in which the transmission rates can be
adjusted by the transmission powers. The price for this flexibility is a
decrease in the throughput scaling law by a multiplicative factor of .Comment: Submitted to IEEE Trans. Information Theor
Hierarchical Radio Resource Optimization for Heterogeneous Networks with Enhanced Inter-cell Interference Coordination (eICIC)
Interference is a major performance bottleneck in Heterogeneous Network
(HetNet) due to its multi-tier topological structure. We propose almost blank
resource block (ABRB) for interference control in HetNet. When an ABRB is
scheduled in a macro BS, a resource block (RB) with blank payload is
transmitted and this eliminates the interference from this macro BS to the pico
BSs. We study a two timescale hierarchical radio resource management (RRM)
scheme for HetNet with dynamic ABRB control. The long term controls, such as
dynamic ABRB, are adaptive to the large scale fading at a RRM server for
co-Tier and cross-Tier interference control. The short term control (user
scheduling) is adaptive to the local channel state information within each BS
to exploit the multi-user diversity. The two timescale optimization problem is
challenging due to the exponentially large solution space. We exploit the
sparsity in the interference graph of the HetNet topology and derive structural
properties for the optimal ABRB control. Based on that, we propose a two
timescale alternative optimization solution for the user scheduling and ABRB
control. The solution has low complexity and is asymptotically optimal at high
SNR. Simulations show that the proposed solution has significant gain over
various baselines.Comment: 14 pages, 8 figure
SINR Analysis of Opportunistic MIMO-SDMA Downlink Systems with Linear Combining
Opportunistic scheduling (OS) schemes have been proposed previously by the
authors for multiuser MIMO-SDMA downlink systems with linear combining. In
particular, it has been demonstrated that significant performance improvement
can be achieved by incorporating low-complexity linear combining techniques
into the design of OS schemes for MIMO-SDMA. However, this previous analysis
was performed based on the effective signal-to-interference ratio (SIR),
assuming an interference-limited scenario, which is typically a valid
assumption in SDMA-based systems. It was shown that the limiting distribution
of the effective SIR is of the Frechet type. Surprisingly, the corresponding
scaling laws were found to follow with , rather
than the conventional form.
Inspired by this difference between the scaling law forms, in this paper a
systematic approach is developed to derive asymptotic throughput and scaling
laws based on signal-to-interference-noise ratio (SINR) by utilizing extreme
value theory. The convergence of the limiting distribution of the effective
SINR to the Gumbel type is established. The resulting scaling law is found to
be governed by the conventional form. These novel results are
validated by simulation results. The comparison of SIR and SINR-based analysis
suggests that the SIR-based analysis is more computationally efficient for
SDMA-based systems and it captures the asymptotic system performance with
higher fidelity.Comment: Proceedings of the 2008 IEEE International Conference on
Communications, Beijing, May 19-23, 200
Downlink Noncoherent Cooperation without Transmitter Phase Alignment
Multicell joint processing can mitigate inter-cell interference and thereby
increase the spectral efficiency of cellular systems. Most previous work has
assumed phase-aligned (coherent) transmissions from different base transceiver
stations (BTSs), which is difficult to achieve in practice. In this work, a
noncoherent cooperative transmission scheme for the downlink is studied, which
does not require phase alignment. The focus is on jointly serving two users in
adjacent cells sharing the same resource block. The two BTSs partially share
their messages through a backhaul link, and each BTS transmits a superposition
of two codewords, one for each receiver. Each receiver decodes its own message,
and treats the signals for the other receiver as background noise. With
narrowband transmissions the achievable rate region and maximum achievable
weighted sum rate are characterized by optimizing the power allocation (and the
beamforming vectors in the case of multiple transmit antennas) at each BTS
between its two codewords. For a wideband (multicarrier) system, a dual
formulation of the optimal power allocation problem across sub-carriers is
presented, which can be efficiently solved by numerical methods. Results show
that the proposed cooperation scheme can improve the sum rate substantially in
the low to moderate signal-to-noise ratio (SNR) range.Comment: 30 pages, 6 figures, submitted to IEEE Transactions on Wireless
Communication
Nearly Optimal Resource Allocation for Downlink OFDMA in 2-D Cellular Networks
In this paper, we propose a resource allocation algorithm for the downlink of
sectorized two-dimensional (2-D) OFDMA cellular networks assuming statistical
Channel State Information (CSI) and fractional frequency reuse. The proposed
algorithm can be implemented in a distributed fashion without the need to any
central controlling units. Its performance is analyzed assuming fast fading
Rayleigh channels and Gaussian distributed multicell interference. We show that
the transmit power of this simple algorithm tends, as the number of users grows
to infinity, to the same limit as the minimal power required to satisfy all
users' rate requirements i.e., the proposed resource allocation algorithm is
asymptotically optimal. As a byproduct of this asymptotic analysis, we
characterize a relevant value of the reuse factor that only depends on an
average state of the network.Comment: submitted to IEEE Transactions on Wireless Communication
- …