اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWhy to Decouple the Uplink and Downlink in Cellular Networks and How To Do It
102
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Ever since the inception of mobile telephony, the downlink and uplink of cellular networks have been coupled, i.e. mobile terminals have been constrained to associate with the same base station (BS) in both the downlink and uplink directions. New trends in network densification and mobile data usage increase the drawbacks of this constraint, and suggest that it should be revisited. In this paper we identify and explain five key arguments in favor of Downlink/Uplink Decoupling (DUDe) based on a blend of theoretical, experimental, and logical arguments. We then overview the changes needed in current (LTE-A) mobile systems to enable this decoupling, and then look ahead to fifth generation (5G) cellular standards. We believe the introduced paradigm will lead to significant gains in network throughput, outage and power consumption at a much lower cost compared to other solutions providing comparable or lower gains.
قيم البحث
اقرأ أيضاً
Decoupling uplink (UL) and downlink (DL) is a new architectural paradigm where DL and UL are not constrained to be associated to the same base station (BS). Building upon this paradigm, the goal of the present paper is to provide lower, albeit tight
bounds for the ergodic UL capacity of a decoupled cellular network. The analysis is performed for a scenario consisting of a macro BS and a set of small cells (SCs) whose positions are selected randomly according to a Poisson point process of a given spatial density. Based on this analysis simple bounds in closed form expressions are defined. The devised bounds are employed to compare the performance of the decoupled case versus a set of benchmark cases, namely the coupled case, and the situations of having either a single macro BS or only SCs. This comparison provides valuable insights regarding the behavior and performance of such networks, providing simpler expressions for the ergodic UL capacity as a function of the distances to the macro BS and the density of SCs. These expressions constitute a simple guide to the minimum degree of densification that guarantees the Quality of Service (QoS) objectives of the network, thus, providing a valuable tool to the network operator of significant practical and commercial value.
We study network utility maximization (NUM) in the context of cellular single station association (SSA) policies, which assigns each mobile user (MU) to a single base station (BS). We measure an SSA policy in terms of the induced alpha-proportional f
airness utility of each users downlink rate, summed over all users. The general SSA NUM problem involves choosing an optimal association from MUs to BSs as well as an optimal allocation of BS resources to associated MUs. Finding an exact solution to such centralized user association problems is well-known to be NP-hard. Our contributions are as follows: i) we give an explicit solution for the optimal BS allocation for a given SSA, which establishes SSA NUM as a purely combinatiorial problem; ii) we establish the integrality gap for the association problem to be one, and prove the relaxation to be a non-convex optimization problem; iii) we provide both centralized and distributed greedy algorithms for SSA, both with and without the exchange of instantaneous rate information between users and stations. Our numerical results illustrate performance gains of three classes of solutions: i) SSA solutions obtained by greedy rounding of multi-station associations (a centralized convex program), ii) our centralized and distributed greedy algorithms with/without rate information exchanged, and iii) simple association heuristics.
While more and more antennas are integrated into single mobile user equipment to increase communication quality and throughput, the number of antennas used for transmission is commonly restricted due to the concerns on hardware complexity and energy
consumption, making it impossible to achieve the maximum channel capacity. This paper investigates the problem of reconstructing the full downlink channel from incomplete uplink channel measurements in Massive MIMO systems. We present ARDI, a scheme that builds a bridge between the radio channel and physical signal propagation environment to link spatial information about the non-transmitting antennas with their radio channels. By inferring locations and orientations of the non-transmitting antennas from an incomplete set of uplink channels, ARDI can reconstruct the downlink channels for non-transmitting antennas. We derive a closed-form solution to reconstruct antenna orientation in both single-path and multi-path propagation environments. The performance of ARDI is evaluated using simulations with realistic human movement. The results demonstrate that ARDI is capable of accurately reconstructing full downlink channels when the signal-to-noise ratio is higher than 15dB, thereby expanding the channel capacity of Massive MIMO networks.
Increasingly, software is making autonomous decisions in case of criminal sentencing, approving credit cards, hiring employees, and so on. Some of these decisions show bias and adversely affect certain social groups (e.g. those defined by sex, race,
age, marital status). Many prior works on bias mitigation take the following form: change the data or learners in multiple ways, then see if any of that improves fairness. Perhaps a better approach is to postulate root causes of bias and then applying some resolution strategy. This paper postulates that the root causes of bias are the prior decisions that affect- (a) what data was selected and (b) the labels assigned to those examples. Our Fair-SMOTE algorithm removes biased labels; and rebalances internal distributions such that based on sensitive attribute, examples are equal in both positive and negative classes. On testing, it was seen that this method was just as effective at reducing bias as prior approaches. Further, models generated via Fair-SMOTE achieve higher performance (measured in terms of recall and F1) than other state-of-the-art fairness improvement algorithms. To the best of our knowledge, measured in terms of number of analyzed learners and datasets, this study is one of the largest studies on bias mitigation yet presented in the literature.
Adversarial reprogramming allows repurposing a machine-learning model to perform a different task. For example, a model trained to recognize animals can be reprogrammed to recognize digits by embedding an adversarial program in the digit images provi
ded as input. Recent work has shown that adversarial reprogramming may not only be used to abuse machine-learning models provided as a service, but also beneficially, to improve transfer learning when training data is scarce. However, the factors affecting its success are still largely unexplained. In this work, we develop a first-order linear model of adversarial reprogramming to show that its success inherently depends on the size of the average input gradient, which grows when input gradients are more aligned, and when inputs have higher dimensionality. The results of our experimental analysis, involving fourteen distinct reprogramming tasks, show that the above factors are correlated with the success and the failure of adversarial reprogramming.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
