401 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
Efficient Heuristic for Resource Allocation in Zero-forcing OFDMA-SDMA Systems with Minimum Rate Constraints
4G wireless access systems require high spectral efficiency to support the
ever increasing number of users and data rates for real time applications.
Multi-antenna OFDM-SDMA systems can provide the required high spectral
efficiency and dynamic usage of the channel, but the resource allocation
process becomes extremely complex because of the augmented degrees of freedom.
In this paper, we propose two heuristics to solve the resource allocation
problem that have very low computational complexity and give performances not
far from the optimal. The proposed heuristics select a set of users for each
subchannel, but contrary to the reported methods that solve the throughput
maximization problem, our heuristics consider the set of real-time (RT) users
to ensure that their minimum rate requirements are met. We compare the
heuristics' performance against an upper bound and other methods proposed in
the literature and find that they give a somewhat lower performance, but
support a wider range of minimum rates while reducing the computational
complexity. The gap between the objective achieved by the heuristics and the
upper bound is not large. In our experiments this gap is 10.7% averaging over
all performed numerical evaluations for all system configurations. The increase
in the range of the supported minimum rates when compared with a method
reported in the literature is 14.6% on average.Comment: 8 figure
Feedback Allocation For OFDMA Systems With Slow Frequency-domain Scheduling
We study the problem of allocating limited feedback resources across multiple
users in an orthogonal-frequency-division-multiple-access downlink system with
slow frequency-domain scheduling. Many flavors of slow frequency-domain
scheduling (e.g., persistent scheduling, semi-persistent scheduling), that
adapt user-sub-band assignments on a slower time-scale, are being considered in
standards such as 3GPP Long-Term Evolution. In this paper, we develop a
feedback allocation algorithm that operates in conjunction with any arbitrary
slow frequency-domain scheduler with the goal of improving the throughput of
the system. Given a user-sub-band assignment chosen by the scheduler, the
feedback allocation algorithm involves solving a weighted sum-rate maximization
at each (slow) scheduling instant. We first develop an optimal
dynamic-programming-based algorithm to solve the feedback allocation problem
with pseudo-polynomial complexity in the number of users and in the total
feedback bit budget. We then propose two approximation algorithms with
complexity further reduced, for scenarios where the problem exhibits additional
structure.Comment: Accepted to IEEE Transactions on Signal Processin
Multiple Access in Aerial Networks: From Orthogonal and Non-Orthogonal to Rate-Splitting
Recently, interest on the utilization of unmanned aerial vehicles (UAVs) has
aroused. Specifically, UAVs can be used in cellular networks as aerial users
for delivery, surveillance, rescue search, or as an aerial base station (aBS)
for communication with ground users in remote uncovered areas or in dense
environments requiring prompt high capacity. Aiming to satisfy the high
requirements of wireless aerial networks, several multiple access techniques
have been investigated. In particular, space-division multiple access(SDMA) and
power-domain non-orthogonal multiple access (NOMA) present promising
multiplexing gains for aerial downlink and uplink. Nevertheless, these gains
are limited as they depend on the conditions of the environment. Hence, a
generalized scheme has been recently proposed, called rate-splitting multiple
access (RSMA), which is capable of achieving better spectral efficiency gains
compared to SDMA and NOMA. In this paper, we present a comprehensive survey of
key multiple access technologies adopted for aerial networks, where aBSs are
deployed to serve ground users. Since there have been only sporadic results
reported on the use of RSMA in aerial systems, we aim to extend the discussion
on this topic by modelling and analyzing the weighted sum-rate performance of a
two-user downlink network served by an RSMA-based aBS. Finally, related open
issues and future research directions are exposed.Comment: 16 pages, 6 figures, submitted to IEEE Journa
Optimality Properties, Distributed Strategies, and Measurement-Based Evaluation of Coordinated Multicell OFDMA Transmission
The throughput of multicell systems is inherently limited by interference and
the available communication resources. Coordinated resource allocation is the
key to efficient performance, but the demand on backhaul signaling and
computational resources grows rapidly with number of cells, terminals, and
subcarriers. To handle this, we propose a novel multicell framework with
dynamic cooperation clusters where each terminal is jointly served by a small
set of base stations. Each base station coordinates interference to neighboring
terminals only, thus limiting backhaul signalling and making the framework
scalable. This framework can describe anything from interference channels to
ideal joint multicell transmission.
The resource allocation (i.e., precoding and scheduling) is formulated as an
optimization problem (P1) with performance described by arbitrary monotonic
functions of the signal-to-interference-and-noise ratios (SINRs) and arbitrary
linear power constraints. Although (P1) is non-convex and difficult to solve
optimally, we are able to prove: 1) Optimality of single-stream beamforming; 2)
Conditions for full power usage; and 3) A precoding parametrization based on a
few parameters between zero and one. These optimality properties are used to
propose low-complexity strategies: both a centralized scheme and a distributed
version that only requires local channel knowledge and processing. We evaluate
the performance on measured multicell channels and observe that the proposed
strategies achieve close-to-optimal performance among centralized and
distributed solutions, respectively. In addition, we show that multicell
interference coordination can give substantial improvements in sum performance,
but that joint transmission is very sensitive to synchronization errors and
that some terminals can experience performance degradations.Comment: Published in IEEE Transactions on Signal Processing, 15 pages, 7
figures. This version corrects typos related to Eq. (4) and Eq. (28
- …