اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDistributed Optimization of Multi-Cell Uplink Co-operation with Backhaul Constraints
246
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We address the problem of uplink co-operative reception with constraints on both backhaul bandwidth and the receiver aperture, or number of antenna signals that can be processed. The problem is cast as a network utility (weighted sum rate) maximization subject to computational complexity and architectural bandwidth sharing constraints. We show that a relaxed version of the problem is convex, and can be solved via a dual-decomposition. The proposed solution is distributed in that each cell broadcasts a set of {em demand prices} based on the data sharing requests they receive. Given the demand prices, the algorithm determines an antenna/cell ordering and antenna-selection for each scheduled user in a cell. This algorithm, referred to as {em LiquidMAAS}, iterates between the preceding two steps. Simulations of realistic network scenarios show that the algorithm exhibits fast convergence even for systems with large number of cells.
قيم البحث
اقرأ أيضاً
In this paper, for the first time, we analytically prove that the uplink (UL) inter-cell interference in frequency division multiple access (FDMA) small cell networks (SCNs) can be well approximated by a lognormal distribution under a certain conditi
on. The lognormal approximation is vital because it allows tractable network performance analysis with closed-form expressions. The derived condition, under which the lognormal approximation applies, does not pose particular requirements on the shapes/sizes of user equipment (UE) distribution areas as in previous works. Instead, our results show that if a path loss related random variable (RV) associated with the UE distribution area, has a low ratio of the 3rd absolute moment to the variance, the lognormal approximation will hold. Analytical and simulation results show that the derived condition can be readily satisfied in future dense/ultra-dense SCNs, indicating that our conclusions are very useful for network performance analysis of the 5th generation (5G) systems with more general cell deployment beyond the widely used Poisson deployment.
In this paper, we analytically derive an upper bound on the error in approximating the uplink (UL) single-cell interference by a lognormal distribution in frequency division multiple access (FDMA) small cell networks (SCNs). Such an upper bound is me
asured by the Kolmogorov Smirnov (KS) distance between the actual cumulative density function (CDF) and the approximate CDF. The lognormal approximation is important because it allows tractable network performance analysis. Our results are more general than the existing works in the sense that we do not pose any requirement on (i) the shape and/or size of cell coverage areas, (ii) the uniformity of user equipment (UE) distribution, and (iii) the type of multi-path fading. Based on our results, we propose a new framework to directly and analytically investigate a complex network with practical deployment of multiple BSs placed at irregular locations, using a power lognormal approximation of the aggregate UL interference. The proposed network performance analysis is particularly useful for the 5th generation (5G) systems with general cell deployment and UE distribution.
A multistatic radar set-up is considered in which distributed receive antennas are connected to a Fusion Center (FC) via limited-capacity backhaul links. Similar to cloud radio access networks in communications, the receive antennas quantize the rece
ived baseband signal before transmitting it to the FC. The problem of maximizing the detection performance at the FC jointly over the code vector used by the transmitting antenna and over the statistics of the noise introduced by backhaul quantization is investigated. Specifically, adopting the information-theoretic criterion of the Bhattacharyya distance to evaluate the detection performance at the FC and information-theoretic measures of the quantization rate, the problem at hand is addressed via a Block Coordinate Descent (BCD) method coupled with Majorization-Minimization (MM). Numerical results demonstrate the advantages of the proposed joint optimization approach over more conventional solutions that perform separate optimization.
Virtual cell optimization clusters cells into neighborhoods and performs optimized resource allocation over each neighborhood. In prior works we proposed resource allocation schemes to mitigate the interference caused by transmissions in the same vir
tual cell. This work aims at mitigating both the interference caused by the transmissions of users in the same virtual cell and the interference between transmissions in different virtual cells. We propose a resource allocation technique that reduces the number of users that cannot achieve their constant guaranteed bit rate, i.e., the unsatisfied users, in an uplink virtual cell system with cooperative decoding. The proposed scheme requires only the knowledge of the number of users each base station serves and relies on creating the interference graph between base stations at the edges of virtual cells. Allocation of frequency bands to users is based on the number of users each base station would serve in a non cooperative setup. We evaluate the performance of our scheme for a mmWave system. Our numerical results show that our scheme decreases the number of users in the system whose rate falls below the guaranteed rate, set to $128$Kpbs, $256$Kpbs or $512$Kpbs, when compared with our previously proposed optimization methods.
The communication cost of distributed optimization algorithms is a major bottleneck in their scalability. This work considers a parameter-server setting in which the worker is constrained to communicate information to the server using only $R$ bits p
er dimension. We show that $mathbf{democratic}$ $mathbf{embeddings}$ from random matrix theory are significantly useful for designing efficient and optimal vector quantizers that respect this bit budget. The resulting polynomial complexity source coding schemes are used to design distributed optimization algorithms with convergence rates matching the minimax optimal lower bounds for (i) Smooth and Strongly-Convex objectives with access to an Exact Gradient oracle, as well as (ii) General Convex and Non-Smooth objectives with access to a Noisy Subgradient oracle. We further propose a relaxation of this coding scheme which is nearly minimax optimal. Numerical simulations validate our theoretical claims.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
