2,250 research outputs found
Optimum channel allocation in OFDMA multi-cell systems
This paper addresses the problem of allocating users to radio resources (i.e., sub-carriers) in the downlink of an OFDMA cellular system. We consider a classical multi-cellular environment with a realistic interference model and a margin adaptive approach, i.e., we aim at minimizing total transmission power while maintaining a certain given rate for each user. We discuss computational complexity issues of the resulting model and present a heuristic approach that finds optima under suitable conditions, or "reasonably good" solutions in the general case. Computational experiences show that, in a comparison with a commercial state-of-the-art optimization solver, our algorithm is quite effective in terms of both infeasibilities and transmitted powers and extremely efficient in terms of CPU times. © 2009 Springer Berlin Heidelberg
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
Spectral Efficiency of Multi-User Adaptive Cognitive Radio Networks
In this correspondence, the comprehensive problem of joint power, rate, and
subcarrier allocation have been investigated for enhancing the spectral
efficiency of multi-user orthogonal frequency-division multiple access (OFDMA)
cognitive radio (CR) networks subject to satisfying total average transmission
power and aggregate interference constraints. We propose novel optimal radio
resource allocation (RRA) algorithms under different scenarios with
deterministic and probabilistic interference violation limits based on a
perfect and imperfect availability of cross-link channel state information
(CSI). In particular, we propose a probabilistic approach to mitigate the total
imposed interference on the primary service under imperfect cross-link CSI. A
closed-form mathematical formulation of the cumulative density function (cdf)
for the received signal-to-interference-plus-noise ratio (SINR) is formulated
to evaluate the resultant average spectral efficiency (ASE). Dual decomposition
is utilized to obtain sub-optimal solutions for the non-convex optimization
problems. Through simulation results, we investigate the achievable performance
and the impact of parameters uncertainty on the overall system performance.
Furthermore, we present that the developed RRA algorithms can considerably
improve the cognitive performance whilst abide the imposed power constraints.
In particular, the performance under imperfect cross-link CSI knowledge for the
proposed `probabilistic case' is compared to the conventional scenarios to show
the potential gain in employing this scheme
Joint User-Association and Resource-Allocation in Virtualized Wireless Networks
In this paper, we consider a down-link transmission of multicell virtualized
wireless networks (VWNs) where users of different service providers (slices)
within a specific region are served by a set of base stations (BSs) through
orthogonal frequency division multiple access (OFDMA). In particular, we
develop a joint BS assignment, sub-carrier and power allocation algorithm to
maximize the network throughput, while satisfying the minimum required rate of
each slice. Under the assumption that each user at each transmission instance
can connect to no more than one BS, we introduce the user-association factor
(UAF) to represent the joint sub-carrier and BS assignment as the optimization
variable vector in the mathematical problem formulation. Sub-carrier reuse is
allowed in different cells, but not within one cell. As the proposed
optimization problem is inherently non-convex and NP-hard, by applying the
successive convex approximation (SCA) and complementary geometric programming
(CGP), we develop an efficient two-step iterative approach with low
computational complexity to solve the proposed problem. For a given
power-allocation, Step 1 derives the optimum userassociation and subsequently,
for an obtained user-association, Step 2 find the optimum power-allocation.
Simulation results demonstrate that the proposed iterative algorithm
outperforms the traditional approach in which each user is assigned to the BS
with the largest average value of signal strength, and then, joint sub-carrier
and power allocation is obtained for the assigned users of each cell.
Especially, for the cell-edge users, simulation results reveal a coverage
improvement up to 57% and 71% for uniform and non-uniform users distribution,
respectively leading to more reliable transmission and higher spectrum
efficiency for VWN
Optical Non-Orthogonal Multiple Access for Visible Light Communication
The proliferation of mobile Internet and connected devices, offering a
variety of services at different levels of performance, represents a major
challenge for the fifth generation wireless networks and beyond. This requires
a paradigm shift towards the development of key enabling techniques for the
next generation wireless networks. In this respect, visible light communication
(VLC) has recently emerged as a new communication paradigm that is capable of
providing ubiquitous connectivity by complementing radio frequency
communications. One of the main challenges of VLC systems, however, is the low
modulation bandwidth of the light-emitting-diodes, which is in the megahertz
range. This article presents a promising technology, referred to as "optical-
non-orthogonal multiple access (O-NOMA)", which is envisioned to address the
key challenges in the next generation of wireless networks. We provide a
detailed overview and analysis of the state-of-the-art integration of O-NOMA in
VLC networks. Furthermore, we provide insights on the potential opportunities
and challenges as well as some open research problems that are envisioned to
pave the way for the future design and implementation of O-NOMA in VLC systems
Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying
This paper addresses a weighted sum rate (WSR) maximization problem for
downlink OFDMA aided by a decode-and-forward (DF) relay under a total power
constraint. A novel subcarrier-pair based opportunistic DF relaying protocol is
proposed. Specifically, user message bits are transmitted in two time slots. A
subcarrier in the first slot can be paired with a subcarrier in the second slot
for the DF relay-aided transmission to a user. In particular, the source and
the relay can transmit simultaneously to implement beamforming at the
subcarrier in the second slot. Each unpaired subcarrier in either the first or
second slot is used for the source's direct transmission to a user. A benchmark
protocol, same as the proposed one except that the transmit beamforming is not
used for the relay-aided transmission, is also considered. For each protocol, a
polynomial-complexity algorithm is developed to find at least an approximately
optimum resource allocation (RA), by using continuous relaxation, the dual
method, and Hungarian algorithm. Instrumental to the algorithm design is an
elegant definition of optimization variables, motivated by the idea of
regarding the unpaired subcarriers as virtual subcarrier pairs in the direct
transmission mode. The effectiveness of the RA algorithm and the impact of
relay position and total power on the protocols' performance are illustrated by
numerical experiments. The proposed protocol always leads to a maximum WSR
equal to or greater than that for the benchmark one, and the performance gain
of using the proposed one is significant especially when the relay is in close
proximity to the source and the total power is low. Theoretical analysis is
presented to interpret these observations.Comment: 8 figures, accepted and to be published in IEEE Transactions on
Signal Processing. arXiv admin note: text overlap with arXiv:1301.293
- …