10,225 research outputs found
Energy-Aware Competitive Power Allocation for Heterogeneous Networks Under QoS Constraints
This work proposes a distributed power allocation scheme for maximizing
energy efficiency in the uplink of orthogonal frequency-division multiple
access (OFDMA)-based heterogeneous networks (HetNets). The user equipment (UEs)
in the network are modeled as rational agents that engage in a non-cooperative
game where each UE allocates its available transmit power over the set of
assigned subcarriers so as to maximize its individual utility (defined as the
user's throughput per Watt of transmit power) subject to minimum-rate
constraints. In this framework, the relevant solution concept is that of Debreu
equilibrium, a generalization of Nash equilibrium which accounts for the case
where an agent's set of possible actions depends on the actions of its
opponents. Since the problem at hand might not be feasible, Debreu equilibria
do not always exist. However, using techniques from fractional programming, we
provide a characterization of equilibrial power allocation profiles when they
do exist. In particular, Debreu equilibria are found to be the fixed points of
a water-filling best response operator whose water level is a function of
minimum rate constraints and circuit power. Moreover, we also describe a set of
sufficient conditions for the existence and uniqueness of Debreu equilibria
exploiting the contraction properties of the best response operator. This
analysis provides the necessary tools to derive a power allocation scheme that
steers the network to equilibrium in an iterative and distributed manner
without the need for any centralized processing. Numerical simulations are then
used to validate the analysis and assess the performance of the proposed
algorithm as a function of the system parameters.Comment: 37 pages, 12 figures, to appear IEEE Trans. Wireless Commu
Eigen-Based Transceivers for the MIMO Broadcast Channel with Semi-Orthogonal User Selection
This paper studies the sum rate performance of two low complexity
eigenmode-based transmission techniques for the MIMO broadcast channel,
employing greedy semi-orthogonal user selection (SUS). The first approach,
termed ZFDPC-SUS, is based on zero-forcing dirty paper coding; the second
approach, termed ZFBF-SUS, is based on zero-forcing beamforming. We first
employ new analytical methods to prove that as the number of users K grows
large, the ZFDPC-SUS approach can achieve the optimal sum rate scaling of the
MIMO broadcast channel. We also prove that the average sum rates of both
techniques converge to the average sum capacity of the MIMO broadcast channel
for large K. In addition to the asymptotic analysis, we investigate the sum
rates achieved by ZFDPC-SUS and ZFBF-SUS for finite K, and show that ZFDPC-SUS
has significant performance advantages. Our results also provide key insights
into the benefit of multiple receive antennas, and the effect of the SUS
algorithm. In particular, we show that whilst multiple receive antennas only
improves the asymptotic sum rate scaling via the second-order behavior of the
multi-user diversity gain; for finite K, the benefit can be very significant.
We also show the interesting result that the semi-orthogonality constraint
imposed by SUS, whilst facilitating a very low complexity user selection
procedure, asymptotically does not reduce the multi-user diversity gain in
either first (log K) or second-order (loglog K) terms.Comment: 35 pages, 3 figures, to appear in IEEE transactions on signal
processin
- …