110 research outputs found
A Survey on Delay-Aware Resource Control for Wireless Systems --- Large Deviation Theory, Stochastic Lyapunov Drift and Distributed Stochastic Learning
In this tutorial paper, a comprehensive survey is given on several major
systematic approaches in dealing with delay-aware control problems, namely the
equivalent rate constraint approach, the Lyapunov stability drift approach and
the approximate Markov Decision Process (MDP) approach using stochastic
learning. These approaches essentially embrace most of the existing literature
regarding delay-aware resource control in wireless systems. They have their
relative pros and cons in terms of performance, complexity and implementation
issues. For each of the approaches, the problem setup, the general solution and
the design methodology are discussed. Applications of these approaches to
delay-aware resource allocation are illustrated with examples in single-hop
wireless networks. Furthermore, recent results regarding delay-aware multi-hop
routing designs in general multi-hop networks are elaborated. Finally, the
delay performance of the various approaches are compared through simulations
using an example of the uplink OFDMA systems.Comment: 58 pages, 8 figures; IEEE Transactions on Information Theory, 201
Predictive Resource Allocation in mmWave Systems with Rotation Detection
Millimeter wave (MmWave) has been regarded as a promising technology to
support high-capacity communications in 5G era. However, its high-layer
performance such as latency and packet drop rate in the long term highly
depends on resource allocation because mmWave channel suffers significant
fluctuation with rotating users due to mmWave sparse channel property and
limited field-of-view (FoV) of antenna arrays. In this paper, downlink
transmission scheduling considering rotation of user equipments (UE) and
limited antenna FoV in an mmWave system is optimized via a novel approximate
Markov decision process (MDP) method. Specifically, we consider the joint
downlink UE selection and power allocation in a number of frames where future
orientations of rotating UEs can be predicted via embedded motion sensors. The
problem is formulated as a finite-horizon MDP with non-stationary state
transition probabilities. A novel low-complexity solution framework is proposed
via one iteration step over a base policy whose average future cost can be
predicted with analytical expressions. It is demonstrated by simulations that
compared with existing benchmarks, the proposed scheme can schedule the
downlink transmission and suppress the packet drop rate efficiently in
non-stationary mmWave links.Comment: 7 pages, 5 figures. Paper accepted for publication in IEEE
International Conference on Communications, 202
Distributed Linear Precoding and User Selection in Coordinated Multicell Systems
In this manuscript we tackle the problem of semi-distributed user selection
with distributed linear precoding for sum rate maximization in multiuser
multicell systems. A set of adjacent base stations (BS) form a cluster in order
to perform coordinated transmission to cell-edge users, and coordination is
carried out through a central processing unit (CU). However, the message
exchange between BSs and the CU is limited to scheduling control signaling and
no user data or channel state information (CSI) exchange is allowed. In the
considered multicell coordinated approach, each BS has its own set of cell-edge
users and transmits only to one intended user while interference to
non-intended users at other BSs is suppressed by signal steering (precoding).
We use two distributed linear precoding schemes, Distributed Zero Forcing (DZF)
and Distributed Virtual Signal-to-Interference-plus-Noise Ratio (DVSINR).
Considering multiple users per cell and the backhaul limitations, the BSs rely
on local CSI to solve the user selection problem. First we investigate how the
signal-to-noise-ratio (SNR) regime and the number of antennas at the BSs affect
the effective channel gain (the magnitude of the channels after precoding) and
its relationship with multiuser diversity. Considering that user selection must
be based on the type of implemented precoding, we develop metrics of
compatibility (estimations of the effective channel gains) that can be computed
from local CSI at each BS and reported to the CU for scheduling decisions.
Based on such metrics, we design user selection algorithms that can find a set
of users that potentially maximizes the sum rate. Numerical results show the
effectiveness of the proposed metrics and algorithms for different
configurations of users and antennas at the base stations.Comment: 12 pages, 6 figure
Queue-Aware Dynamic Clustering and Power Allocation for Network MIMO Systems via Distributive Stochastic Learning
In this paper, we propose a two-timescale delay-optimal dynamic clustering
and power allocation design for downlink network MIMO systems. The dynamic
clustering control is adaptive to the global queue state information (GQSI)
only and computed at the base station controller (BSC) over a longer time
scale. On the other hand, the power allocations of all the BSs in one cluster
are adaptive to both intra-cluster channel state information (CCSI) and
intra-cluster queue state information (CQSI), and computed at the cluster
manager (CM) over a shorter time scale. We show that the two-timescale
delay-optimal control can be formulated as an infinite-horizon average cost
Constrained Partially Observed Markov Decision Process (CPOMDP). By exploiting
the special problem structure, we shall derive an equivalent Bellman equation
in terms of Pattern Selection Q-factor to solve the CPOMDP. To address the
distributive requirement and the issue of exponential memory requirement and
computational complexity, we approximate the Pattern Selection Q-factor by the
sum of Per-cluster Potential functions and propose a novel distributive online
learning algorithm to estimate the Per-cluster Potential functions (at each CM)
as well as the Lagrange multipliers (LM) (at each BS). We show that the
proposed distributive online learning algorithm converges almost surely (with
probability 1). By exploiting the birth-death structure of the queue dynamics,
we further decompose the Per-cluster Potential function into sum of Per-cluster
Per-user Potential functions and formulate the instantaneous power allocation
as a Per-stage QSI-aware Interference Game played among all the CMs. We also
propose a QSI-aware Simultaneous Iterative Water-filling Algorithm (QSIWFA) and
show that it can achieve the Nash Equilibrium (NE)
Joint QoS-Aware Scheduling and Precoding for Massive MIMO Systems via Deep Reinforcement Learning
The rapid development of mobile networks proliferates the demands of high
data rate, low latency, and high-reliability applications for the
fifth-generation (5G) and beyond (B5G) mobile networks. Concurrently, the
massive multiple-input-multiple-output (MIMO) technology is essential to
realize the vision and requires coordination with resource management functions
for high user experiences. Though conventional cross-layer adaptation
algorithms have been developed to schedule and allocate network resources, the
complexity of resulting rules is high with diverse quality of service (QoS)
requirements and B5G features. In this work, we consider a joint user
scheduling, antenna allocation, and precoding problem in a massive MIMO system.
Instead of directly assigning resources, such as the number of antennas, the
allocation process is transformed into a deep reinforcement learning (DRL)
based dynamic algorithm selection problem for efficient Markov decision process
(MDP) modeling and policy training. Specifically, the proposed utility function
integrates QoS requirements and constraints toward a long-term system-wide
objective that matches the MDP return. The componentized action structure with
action embedding further incorporates the resource management process into the
model. Simulations show 7.2% and 12.5% more satisfied users against static
algorithm selection and related works under demanding scenarios
Energy-Efficient Resource Allocation Optimization for Multimedia Heterogeneous Cloud Radio Access Networks
The heterogeneous cloud radio access network (H-CRAN) is a promising paradigm
which incorporates the cloud computing into heterogeneous networks (HetNets),
thereby taking full advantage of cloud radio access networks (C-RANs) and
HetNets. Characterizing the cooperative beamforming with fronthaul capacity and
queue stability constraints is critical for multimedia applications to
improving energy efficiency (EE) in H-CRANs. An energy-efficient optimization
objective function with individual fronthaul capacity and inter-tier
interference constraints is presented in this paper for queue-aware multimedia
H-CRANs. To solve this non-convex objective function, a stochastic optimization
problem is reformulated by introducing the general Lyapunov optimization
framework. Under the Lyapunov framework, this optimization problem is
equivalent to an optimal network-wide cooperative beamformer design algorithm
with instantaneous power, average power and inter-tier interference
constraints, which can be regarded as the weighted sum EE maximization problem
and solved by a generalized weighted minimum mean square error approach. The
mathematical analysis and simulation results demonstrate that a tradeoff
between EE and queuing delay can be achieved, and this tradeoff strictly
depends on the fronthaul constraint
- …