43 research outputs found
Energy-Efficient Scheduling and Power Allocation in Downlink OFDMA Networks with Base Station Coordination
This paper addresses the problem of energy-efficient resource allocation in
the downlink of a cellular OFDMA system. Three definitions of the energy
efficiency are considered for system design, accounting for both the radiated
and the circuit power. User scheduling and power allocation are optimized
across a cluster of coordinated base stations with a constraint on the maximum
transmit power (either per subcarrier or per base station). The asymptotic
noise-limited regime is discussed as a special case. %The performance of both
an isolated and a non-isolated cluster of coordinated base stations is examined
in the numerical experiments. Results show that the maximization of the energy
efficiency is approximately equivalent to the maximization of the spectral
efficiency for small values of the maximum transmit power, while there is a
wide range of values of the maximum transmit power for which a moderate
reduction of the data rate provides a large saving in terms of dissipated
energy. Also, the performance gap among the considered resource allocation
strategies reduces as the out-of-cluster interference increases.Comment: to appear on IEEE Transactions on Wireless Communication
Investigation of Cooperation Technologies in Heterogeneous Wireless Networks
Heterogeneous wireless networks based on varieties of radio access technologies (RATs) and standards will coexist in the future. In order to exploit this potential multiaccess gain, it is required that different RATs are managed in a cooperative fashion. This paper proposes two advanced functional architecture supporting the functionalities of interworking between WiMAX and 3GPP networks as a specific case: Radio Control Server-(RCS-) and Access Point-(AP-) based centralized architectures. The key technologies supporting the interworking are then investigated, including proposing the Generic Link Layer (GLL) and researching the multiradio resource management (MRRM) mechanisms. This paper elaborates on these topics, and the corresponding solutions are proposed with preliminary results
Fundamental Limits of Cooperation
Cooperation is viewed as a key ingredient for interference management in
wireless systems. This paper shows that cooperation has fundamental
limitations. The main result is that even full cooperation between transmitters
cannot in general change an interference-limited network to a noise-limited
network. The key idea is that there exists a spectral efficiency upper bound
that is independent of the transmit power. First, a spectral efficiency upper
bound is established for systems that rely on pilot-assisted channel
estimation; in this framework, cooperation is shown to be possible only within
clusters of limited size, which are subject to out-of-cluster interference
whose power scales with that of the in-cluster signals. Second, an upper bound
is also shown to exist when cooperation is through noncoherent communication;
thus, the spectral efficiency limitation is not a by-product of the reliance on
pilot-assisted channel estimation. Consequently, existing literature that
routinely assumes the high-power spectral efficiency scales with the log of the
transmit power provides only a partial characterization. The complete
characterization proposed in this paper subdivides the high-power regime into a
degrees-of-freedom regime, where the scaling with the log of the transmit power
holds approximately, and a saturation regime, where the spectral efficiency
hits a ceiling that is independent of the power. Using a cellular system as an
example, it is demonstrated that the spectral efficiency saturates at power
levels of operational relevance.Comment: 27 page
Sample Approximation-Based Deflation Approaches for Chance SINR Constrained Joint Power and Admission Control
Consider the joint power and admission control (JPAC) problem for a
multi-user single-input single-output (SISO) interference channel. Most
existing works on JPAC assume the perfect instantaneous channel state
information (CSI). In this paper, we consider the JPAC problem with the
imperfect CSI, that is, we assume that only the channel distribution
information (CDI) is available. We formulate the JPAC problem into a chance
(probabilistic) constrained program, where each link's SINR outage probability
is enforced to be less than or equal to a specified tolerance. To circumvent
the computational difficulty of the chance SINR constraints, we propose to use
the sample (scenario) approximation scheme to convert them into finitely many
simple linear constraints. Furthermore, we reformulate the sample approximation
of the chance SINR constrained JPAC problem as a composite group sparse
minimization problem and then approximate it by a second-order cone program
(SOCP). The solution of the SOCP approximation can be used to check the
simultaneous supportability of all links in the network and to guide an
iterative link removal procedure (the deflation approach). We exploit the
special structure of the SOCP approximation and custom-design an efficient
algorithm for solving it. Finally, we illustrate the effectiveness and
efficiency of the proposed sample approximation-based deflation approaches by
simulations.Comment: The paper has been accepted for publication in IEEE Transactions on
Wireless Communication