9,784 research outputs found
Power and Channel Allocation for Non-orthogonal Multiple Access in 5G Systems: Tractability and Computation
Network capacity calls for significant increase for 5G cellular systems. A
promising multi-user access scheme, non-orthogonal multiple access (NOMA) with
successive interference cancellation (SIC), is currently under consideration.
In NOMA, spectrum efficiency is improved by allowing more than one user to
simultaneously access the same frequency-time resource and separating
multi-user signals by SIC at the receiver. These render resource allocation and
optimization in NOMA different from orthogonal multiple access in 4G. In this
paper, we provide theoretical insights and algorithmic solutions to jointly
optimize power and channel allocation in NOMA. For utility maximization, we
mathematically formulate NOMA resource allocation problems. We characterize and
analyze the problems' tractability under a range of constraints and utility
functions. For tractable cases, we provide polynomial-time solutions for global
optimality. For intractable cases, we prove the NP-hardness and propose an
algorithmic framework combining Lagrangian duality and dynamic programming
(LDDP) to deliver near-optimal solutions. To gauge the performance of the
obtained solutions, we also provide optimality bounds on the global optimum.
Numerical results demonstrate that the proposed algorithmic solution can
significantly improve the system performance in both throughput and fairness
over orthogonal multiple access as well as over a previous NOMA resource
allocation scheme.Comment: IEEE Transactions on Wireless Communications, revisio
Unified and Distributed QoS-Driven Cell Association Algorithms in Heterogeneous Networks
This paper addresses the cell association problem in the downlink of a
multi-tier heterogeneous network (HetNet), where base stations (BSs) have
finite number of resource blocks (RBs) available to distribute among their
associated users. Two problems are defined and treated in this paper: sum
utility of long term rate maximization with long term rate quality of service
(QoS) constraints, and global outage probability minimization with outage QoS
constraints. The first problem is well-suited for low mobility environments,
while the second problem provides a framework to deal with environments with
fast fading. The defined optimization problems in this paper are solved in two
phases: cell association phase followed by the optional RB distribution phase.
We show that the cell association phase of both problems have the same
structure. Based on this similarity, we propose a unified distributed algorithm
with low levels of message passing to for the cell association phase. This
distributed algorithm is derived by relaxing the association constraints and
using Lagrange dual decomposition method. In the RB distribution phase, the
remaining RBs after the cell association phase are distributed among the users.
Simulation results show the superiority of our distributed cell association
scheme compared to schemes that are based on maximum signal to interference
plus noise ratio (SINR)
Joint Power Allocation and User Association Optimization for Massive MIMO Systems
This paper investigates the joint power allocation and user association
problem in multi-cell Massive MIMO (multiple-input multiple-output) downlink
(DL) systems. The target is to minimize the total transmit power consumption
when each user is served by an optimized subset of the base stations (BSs),
using non-coherent joint transmission. We first derive a lower bound on the
ergodic spectral efficiency (SE), which is applicable for any channel
distribution and precoding scheme. Closed-form expressions are obtained for
Rayleigh fading channels with either maximum ratio transmission (MRT) or zero
forcing (ZF) precoding. From these bounds, we further formulate the DL power
minimization problems with fixed SE constraints for the users. These problems
are proved to be solvable as linear programs, giving the optimal power
allocation and BS-user association with low complexity. Furthermore, we
formulate a max-min fairness problem which maximizes the worst SE among the
users, and we show that it can be solved as a quasi-linear program. Simulations
manifest that the proposed methods provide good SE for the users using less
transmit power than in small-scale systems and the optimal user association can
effectively balance the load between BSs when needed. Even though our framework
allows the joint transmission from multiple BSs, there is an overwhelming
probability that only one BS is associated with each user at the optimal
solution.Comment: 16 pages, 12 figures, Accepted by IEEE Trans. Wireless Commu
On the optimization of distributed compression in multirelay cooperative networks
In this paper, we consider multirelay cooperative networks for the Rayleigh fading channel, where each relay, upon receiving its own channel observation, independently compresses it and forwards the compressed information to the destination. Although the compression at each relay is distributed using Wyner-Ziv coding, there exists an opportunity for jointly optimizing compression at multiple relays to maximize the achievable rate. Considering Gaussian signaling, a primal optimization problem is formulated accordingly. We prove that the primal problem can be solved by resorting to its Lagrangian dual problem, and an iterative optimization algorithm is proposed. The analysis is further extended to a hybrid scheme, where the employed forwarding scheme depends on the decoding status of each relay. The relays that are capable of successful decoding perform a decode-and-forward (DF) scheme, and the rest conduct distributed compression. The hybrid scheme allows the cooperative network to adapt to the changes of the channel conditions and benefit from an enhanced level of flexibility. Numerical results from both spectrum and energy efficiency perspectives show that the joint optimization improves efficiency of compression and identify the scenarios where the proposed schemes outperform the conventional forwarding schemes. The findings provide important insights into the optimal deployment of relays in a realistic cellular network
A Scalable Algorithm For Sparse Portfolio Selection
The sparse portfolio selection problem is one of the most famous and
frequently-studied problems in the optimization and financial economics
literatures. In a universe of risky assets, the goal is to construct a
portfolio with maximal expected return and minimum variance, subject to an
upper bound on the number of positions, linear inequalities and minimum
investment constraints. Existing certifiably optimal approaches to this problem
do not converge within a practical amount of time at real world problem sizes
with more than 400 securities. In this paper, we propose a more scalable
approach. By imposing a ridge regularization term, we reformulate the problem
as a convex binary optimization problem, which is solvable via an efficient
outer-approximation procedure. We propose various techniques for improving the
performance of the procedure, including a heuristic which supplies high-quality
warm-starts, a preprocessing technique for decreasing the gap at the root node,
and an analytic technique for strengthening our cuts. We also study the
problem's Boolean relaxation, establish that it is second-order-cone
representable, and supply a sufficient condition for its tightness. In
numerical experiments, we establish that the outer-approximation procedure
gives rise to dramatic speedups for sparse portfolio selection problems.Comment: Submitted to INFORMS Journal on Computin
Energy-Efficient Multi-View Video Transmission with View Synthesis-Enabled Multicast
Multi-view videos (MVVs) provide immersive viewing experience, at the cost of
heavy load to wireless networks. Except for further improving viewing
experience, view synthesis can create multicast opportunities for efficient
transmission of MVVs in multiuser wireless networks, which has not been
recognized in existing literature. In this paper, we would like to exploit view
synthesis-enabled multicast opportunities for energy-efficient MVV transmission
in a multiuser wireless network. Specifically, we first establish a
mathematical model to characterize the impact of view synthesis on multicast
opportunities and energy consumption. Then, we consider the optimization of
view selection, transmission time and power allocation to minimize the weighted
sum energy consumption for view transmission and synthesis, which is a
challenging mixed discrete-continuous optimization problem. We propose an
algorithm to obtain an optimal solution with reduced computational complexity
by exploiting optimality properties. To further reduce computational
complexity, we also propose two low-complexity algorithms to obtain two
suboptimal solutions, based on continuous relaxation and Difference of Convex
(DC) programming, respectively. Finally, numerical results demonstrate the
advantage of the proposed solutions.Comment: 22 pages, 6 figures, to be published in GLOBECOM 201
- …