2,128 research outputs found
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in multi-cell wireless networks and resource allocation in computer systems, we study a service facility with two types of users (or jobs) having heterogen
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous service requirement distributions. The aggregate service capacity is assumed to be largest when both classes are served in parallel, but giving preferential treatment to one of the classes may be advantageous when aiming at minimization of the number of users, or when classes have different economic values, for example. We set out to determine the allocation policies that minimize the total number of users in the system. For some particular cases we can determine the optimal policy exactly, but in general this is not analytically feasible. We then study the optimal policies in the fluid regime, which prove to be close to optimal in the original stochastic model. These policies can be characterized by either linear or exponential switching curves. We numerically compare our results with existing approximations based on optimization in the heavy-traffic regime. By simulations we show that, in general, our simple computable switching-curve strategies based on the fluid analysis perform well
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
Power Allocation Schemes for Multicell Massive MIMO Systems
This paper investigates the sum-rate gains brought by power allocation
strategies in multicell massive multipleinput multiple-output systems, assuming
time-division duplex transmission. For both uplink and downlink, we derive
tractable expressions for the achievable rate with zero-forcing receivers and
precoders respectively. To avoid high complexity joint optimization across the
network, we propose a scheduling mechanism for power allocation, where in a
single time slot, only cells that do not interfere with each other adjust their
transmit powers. Based on this, corresponding transmit power allocation
strategies are derived, aimed at maximizing the sum rate per-cell. These
schemes are shown to bring considerable gains over equal power allocation for
practical antenna configurations (e.g., up to a few hundred). However, with
fixed number of users (N), these gains diminish as M turns to infinity, and
equal power allocation becomes optimal. A different conclusion is drawn for the
case where both M and N grow large together, in which case: (i) improved rates
are achieved as M grows with fixed M/N ratio, and (ii) the relative gains over
the equal power allocation diminish as M/N grows. Moreover, we also provide
applicable values of M/N under an acceptable power allocation gain threshold,
which can be used as to determine when the proposed power allocation schemes
yield appreciable gains, and when they do not. From the network point of view,
the proposed scheduling approach can achieve almost the same performance as the
joint power allocation after one scheduling round, with much reduced
complexity
- âŠ