1,108 research outputs found
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
Decentralized Fair Scheduling in Two-Hop Relay-Assisted Cognitive OFDMA Systems
In this paper, we consider a two-hop relay-assisted cognitive downlink OFDMA
system (named as secondary system) dynamically accessing a spectrum licensed to
a primary network, thereby improving the efficiency of spectrum usage. A
cluster-based relay-assisted architecture is proposed for the secondary system,
where relay stations are employed for minimizing the interference to the users
in the primary network and achieving fairness for cell-edge users. Based on
this architecture, an asymptotically optimal solution is derived for jointly
controlling data rates, transmission power, and subchannel allocation to
optimize the average weighted sum goodput where the proportional fair
scheduling (PFS) is included as a special case. This solution supports
decentralized implementation, requires small communication overhead, and is
robust against imperfect channel state information at the transmitter (CSIT)
and sensing measurement. The proposed solution achieves significant throughput
gains and better user-fairness compared with the existing designs. Finally, we
derived a simple and asymptotically optimal scheduling solution as well as the
associated closed-form performance under the proportional fair scheduling for a
large number of users. The system throughput is shown to be
, where is the
number of users in one cluster, is the number of subchannels and is
the active probability of primary users.Comment: 29 pages, 9 figures, IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL
PROCESSIN
Scheduling strategies for LTE uplink with flow behaviour analysis
Long Term Evolution (LTE) is a cellular technology developed to support\ud
diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key\ud
mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and time dimension. In this paper we present a performance comparison of two distinct scheduling schemes for LTE uplink (fair fixed assignment and fair work-conserving) taking into account both packet level characteristics and flow level dynamics due to the random user behaviour. For that purpose, we apply a combined analytical/simulation approach which enables fast evaluation of performance measures such as mean flow transfer times manifesting the impact of resource allocation strategies. The results show that the resource allocation strategy has a crucial impact on performance and that some trends are observed only if flow level dynamics are considered
Two-Layered Superposition of Broadcast/Multicast and Unicast Signals in Multiuser OFDMA Systems
We study optimal delivery strategies of one common and independent
messages from a source to multiple users in wireless environments. In
particular, two-layered superposition of broadcast/multicast and unicast
signals is considered in a downlink multiuser OFDMA system. In the literature
and industry, the two-layer superposition is often considered as a pragmatic
approach to make a compromise between the simple but suboptimal orthogonal
multiplexing (OM) and the optimal but complex fully-layered non-orthogonal
multiplexing. In this work, we show that only two-layers are necessary to
achieve the maximum sum-rate when the common message has higher priority than
the individual unicast messages, and OM cannot be sum-rate optimal in
general. We develop an algorithm that finds the optimal power allocation over
the two-layers and across the OFDMA radio resources in static channels and a
class of fading channels. Two main use-cases are considered: i) Multicast and
unicast multiplexing when users with uplink capabilities request both
common and independent messages, and ii) broadcast and unicast multiplexing
when the common message targets receive-only devices and users with uplink
capabilities additionally request independent messages. Finally, we develop a
transceiver design for broadcast/multicast and unicast superposition
transmission based on LTE-A-Pro physical layer and show with numerical
evaluations in mobile environments with multipath propagation that the capacity
improvements can be translated into significant practical performance gains
compared to the orthogonal schemes in the 3GPP specifications. We also analyze
the impact of real channel estimation and show that significant gains in terms
of spectral efficiency or coverage area are still available even with
estimation errors and imperfect interference cancellation for the two-layered
superposition system
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
Power-efficient resource allocation in NOMA virtualized wireless networks
In this paper, we address a power-efficient resource
allocation problem in virtualized wireless networks (VWNs) using
non-orthogonal multiple access (NOMA). In this set-up, the resources
of one base station (BS) are shared among different service
providers (slices), where the minimum reserved rate is considered
for each slice for guaranteeing their isolation. The formulated
resource allocation problem aiming to minimize the total transmit
power subject to the isolation constraints is non-convex and suffers
from high computational complexity. By applying complementary
geometric programming (CGP) to convert the non-convex problem
into the convex form, we develop an efficient iterative approach
with low computational complexity to solve the proposed problem.
Illustrative simulation results on the performance evaluation of
VWN using OFDMA and NOMA indicate significant performance
improvement in the VWN when NOMA is used
Practical Resource Allocation Algorithms for QoS in OFDMA-based Wireless Systems
In this work we propose an efficient resource allocation algorithm for OFDMA
based wireless systems supporting heterogeneous traffic. The proposed algorithm
provides proportionally fairness to data users and short term rate guarantees
to real-time users. Based on the QoS requirements, buffer occupancy and channel
conditions, we propose a scheme for rate requirement determination for delay
constrained sessions. Then we formulate and solve the proportional fair rate
allocation problem subject to those rate requirements and power/bandwidth
constraints. Simulations results show that the proposed algorithm provides
significant improvement with respect to the benchmark algorithm.Comment: To be presented at 2nd IEEE International Broadband Wireless Access
Workshop. Las Vegas, Nevada USA Jan 12 200
- …