18,505 research outputs found
Energy-efficiency for MISO-OFDMA based user-relay assisted cellular networks
The concept of improving energy-efficiency (EE) without sacrificing the service quality has become important nowadays. The combination of orthogonal frequency-division multiple-access (OFDMA) multi-antenna transmission technology and relaying is one of the key technologies to deliver the promise of reliable and high-data-rate coverage in the most cost-effective manner. In this paper, EE is studied for the downlink multiple-input single-output (MISO)-OFDMA based user-relay assisted cellular networks. EE maximization is formulated for decode and forward (DF) relaying scheme with the consideration of both transmit and circuit power consumption as well as the data rate requirements for the mobile users. The quality of-service (QoS)-constrained EE maximization, which is defined for multi-carrier, multi-user, multi-relay and multi-antenna networks, is a non-convex and combinatorial problem so it is hard to tackle. To solve this difficult problem, a radio resource management (RRM) algorithm that solves the subcarrier allocation, mode selection and power allocation separately is proposed. The efficiency of the proposed algorithm is demonstrated by numerical results for different system parameter
Discrete and Continuous Optimization Methods for Self-Organization in Small Cell Networks - Models and Algorithms
Self-organization is discussed in terms of distributed computational methods and algorithms for resource allocation in cellular networks. In order to develop algorithms for different self-organization problems pertinent to small cell networks (SCN), a number of concepts from discrete and continuous optimization theory are employed. Self-organized resource allocation problems such as physical cell identifier (PCI) assignment and primary component carrier selection are formulated as discrete optimization problems. Distributed graph coloring and constraint satisfaction algorithms are used to solve these problems. The PCI assignment is also discussed for multi-operator heterogeneous networks. Furthermore, different variants of simulated annealing are proposed for solving a graph coloring formulation of the orthogonal resource allocation problem.
In the continuous optimization domain, a network utility maximization approach is considered for solving different resource allocation problems. Network synchronization is addressed using greedy and gradient search algorithms. Primal and dual decomposition are discussed for transmit power and scheduling weight optimizations, under a network-wide power constraint. Joint optimization over transmit powers and multi-user scheduling weights is considered in a multi-carrier SCN, for both maximum rate and proportional-fair rate utilities. This formulation is extended for multiple-input multiple-output (MIMO) SCNs, where apart from transmit powers and multi-user scheduling weights, the transmit precoders are also optimized, for a generic alpha-fair utility function. Optimization of network resources over multiple degrees of freedom is particularly effective in reducing mutual interference, leading to significant gains in network utility. Finally, an alternate formulation of transmit power allocation is considered, in which the network transmit power is minimized subject to the data rate constraints of users. Thus, network resource allocation algorithms inspired by optimization theory constitute an effective approach for self-organization in contemporary as well as future cellular networks
An Application-Aware Spectrum Sharing Approach for Commercial Use of 3.5 GHz Spectrum
In this paper, we introduce an application-aware spectrum sharing approach
for sharing the Federal under-utilized 3.5 GHz spectrum with commercial users.
In our model, users are running elastic or inelastic traffic and each
application running on the user equipment (UE) is assigned a utility function
based on its type. Furthermore, each of the small cells users has a minimum
required target utility for its application. In order for users located under
the coverage area of the small cells' eNodeBs, with the 3.5 GHz band resources,
to meet their minimum required quality of experience (QoE), the network
operator makes a decision regarding the need for sharing the macro cell's
resources to obtain additional resources. Our objective is to provide each user
with a rate that satisfies its application's minimum required utility through
spectrum sharing approach and improve the overall QoE in the network. We
present an application-aware spectrum sharing algorithm that is based on
resource allocation with carrier aggregation to allocate macro cell permanent
resources and small cells' leased resources to UEs and allocate each user's
application an aggregated rate that can at minimum achieves the application's
minimum required utility. Finally, we present simulation results for the
performance of the proposed algorithm.Comment: Submitted to IEE
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
- …