642 research outputs found
Distributed Multicell Beamforming Design Approaching Pareto Boundary with Max-Min Fairness
This paper addresses coordinated downlink beamforming optimization in
multicell time-division duplex (TDD) systems where a small number of parameters
are exchanged between cells but with no data sharing. With the goal to reach
the point on the Pareto boundary with max-min rate fairness, we first develop a
two-step centralized optimization algorithm to design the joint beamforming
vectors. This algorithm can achieve a further sum-rate improvement over the
max-min optimal performance, and is shown to guarantee max-min Pareto
optimality for scenarios with two base stations (BSs) each serving a single
user. To realize a distributed solution with limited intercell communication,
we then propose an iterative algorithm by exploiting an approximate
uplink-downlink duality, in which only a small number of positive scalars are
shared between cells in each iteration. Simulation results show that the
proposed distributed solution achieves a fairness rate performance close to the
centralized algorithm while it has a better sum-rate performance, and
demonstrates a better tradeoff between sum-rate and fairness than the Nash
Bargaining solution especially at high signal-to-noise ratio.Comment: 8 figures. To Appear in IEEE Trans. Wireless Communications, 201
Joint Beamforming and Power Control in Coordinated Multicell: Max-Min Duality, Effective Network and Large System Transition
This paper studies joint beamforming and power control in a coordinated
multicell downlink system that serves multiple users per cell to maximize the
minimum weighted signal-to-interference-plus-noise ratio. The optimal solution
and distributed algorithm with geometrically fast convergence rate are derived
by employing the nonlinear Perron-Frobenius theory and the multicell network
duality. The iterative algorithm, though operating in a distributed manner,
still requires instantaneous power update within the coordinated cluster
through the backhaul. The backhaul information exchange and message passing may
become prohibitive with increasing number of transmit antennas and increasing
number of users. In order to derive asymptotically optimal solution, random
matrix theory is leveraged to design a distributed algorithm that only requires
statistical information. The advantage of our approach is that there is no
instantaneous power update through backhaul. Moreover, by using nonlinear
Perron-Frobenius theory and random matrix theory, an effective primal network
and an effective dual network are proposed to characterize and interpret the
asymptotic solution.Comment: Some typos in the version publised in the IEEE Transactions on
Wireless Communications are correcte
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
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
Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks
Soaring capacity and coverage demands dictate that future cellular networks
need to soon migrate towards ultra-dense networks. However, network
densification comes with a host of challenges that include compromised energy
efficiency, complex interference management, cumbersome mobility management,
burdensome signaling overheads and higher backhaul costs. Interestingly, most
of the problems, that beleaguer network densification, stem from legacy
networks' one common feature i.e., tight coupling between the control and data
planes regardless of their degree of heterogeneity and cell density.
Consequently, in wake of 5G, control and data planes separation architecture
(SARC) has recently been conceived as a promising paradigm that has potential
to address most of aforementioned challenges. In this article, we review
various proposals that have been presented in literature so far to enable SARC.
More specifically, we analyze how and to what degree various SARC proposals
address the four main challenges in network densification namely: energy
efficiency, system level capacity maximization, interference management and
mobility management. We then focus on two salient features of future cellular
networks that have not yet been adapted in legacy networks at wide scale and
thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and
device-to-device (D2D) communications. After providing necessary background on
CoMP and D2D, we analyze how SARC can particularly act as a major enabler for
CoMP and D2D in context of 5G. This article thus serves as both a tutorial as
well as an up to date survey on SARC, CoMP and D2D. Most importantly, the
article provides an extensive outlook of challenges and opportunities that lie
at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201
- …