828 research outputs found
Dynamic Uplink/Downlink Resource Management in Flexible Duplex-Enabled Wireless Networks
Flexible duplex is proposed to adapt to the channel and traffic asymmetry for
future wireless networks. In this paper, we propose two novel algorithms within
the flexible duplex framework for joint uplink and downlink resource allocation
in multi-cell scenario, named SAFP and RMDI, based on the awareness of
interference coupling among wireless links. Numerical results show significant
performance gain over the baseline system with fixed uplink/downlink resource
configuration, and over the dynamic TDD scheme that independently adapts the
configuration to time-varying traffic volume in each cell. The proposed
algorithms achieve two-fold increase when compared with the baseline scheme,
measured by the worst-case quality of service satisfaction level, under a low
level of traffic asymmetry. The gain is more significant when the traffic is
highly asymmetric, as it achieves three-fold increase.Comment: 7 pages, 7 figures, ICC 2017 Worksho
Joint Downlink Base Station Association and Power Control for Max-Min Fairness: Computation and Complexity
In a heterogeneous network (HetNet) with a large number of low power base
stations (BSs), proper user-BS association and power control is crucial to
achieving desirable system performance. In this paper, we systematically study
the joint BS association and power allocation problem for a downlink cellular
network under the max-min fairness criterion. First, we show that this problem
is NP-hard. Second, we show that the upper bound of the optimal value can be
easily computed, and propose a two-stage algorithm to find a high-quality
suboptimal solution. Simulation results show that the proposed algorithm is
near-optimal in the high-SNR regime. Third, we show that the problem under some
additional mild assumptions can be solved to global optima in polynomial time
by a semi-distributed algorithm. This result is based on a transformation of
the original problem to an assignment problem with gains , where
are the channel gains.Comment: 24 pages, 7 figures, a shorter version submitted to IEEE JSA
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
Mobile Edge Computing via a UAV-Mounted Cloudlet: Optimization of Bit Allocation and Path Planning
Unmanned Aerial Vehicles (UAVs) have been recently considered as means to
provide enhanced coverage or relaying services to mobile users (MUs) in
wireless systems with limited or no infrastructure. In this paper, a UAV-based
mobile cloud computing system is studied in which a moving UAV is endowed with
computing capabilities to offer computation offloading opportunities to MUs
with limited local processing capabilities. The system aims at minimizing the
total mobile energy consumption while satisfying quality of service
requirements of the offloaded mobile application. Offloading is enabled by
uplink and downlink communications between the mobile devices and the UAV that
take place by means of frequency division duplex (FDD) via orthogonal or
non-orthogonal multiple access (NOMA) schemes. The problem of jointly
optimizing the bit allocation for uplink and downlink communication as well as
for computing at the UAV, along with the cloudlet's trajectory under latency
and UAV's energy budget constraints is formulated and addressed by leveraging
successive convex approximation (SCA) strategies. Numerical results demonstrate
the significant energy savings that can be accrued by means of the proposed
joint optimization of bit allocation and cloudlet's trajectory as compared to
local mobile execution as well as to partial optimization approaches that
design only the bit allocation or the cloudlet's trajectory.Comment: 14 pages, 5 figures, 2 tables, IEEE Transactions on Vehicular
Technolog
- …