اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMulti-User Scheduling in the 3GPP LTE Cellular Uplink
187
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we consider resource allocation in the 3GPP Long Term Evolution (LTE) cellular uplink, which will be the most widely deployed next generation cellular uplink. The key features of the 3GPP LTE uplink (UL) are that it is based on a modified form of the orthogonal frequency division multiplexing based multiple access (OFDMA) which enables channel dependent frequency selective scheduling, and that it allows for multi-user (MU) scheduling wherein multiple users can be assigned the same time-frequency resource. In addition to the considerable spectral efficiency improvements that are possible by exploiting these two features, the LTE UL allows for transmit antenna selection together with the possibility to employ advanced receivers at the base-station, which promise further gains. However, several practical constraints that seek to maintain a low signaling overhead, are also imposed. In this paper, we show that the resulting resource allocation problem is APX-hard and then propose a local ratio test (LRT) based constant-factor polynomial-time approximation algorithm. We then propose two enhancements to this algorithm as well as a sequential LRT based MU scheduling algorithm that offers a constant-factor approximation and is another useful choice in the complexity versus performance tradeoff. Further, user pre-selection, wherein a smaller pool of good users is pre-selected and a sophisticated scheduling algorithm is then employed on the selected pool, is also examined. We suggest several such user pre-selection algorithms, some of which are shown to offer constant-factor approximations to the pre-selection problem. Detailed evaluations reveal that the proposed algorithms and their enhancements offer significant gains.
قيم البحث
اقرأ أيضاً
We consider Multi-User MIMO (MU-MIMO) scheduling in the 3GPP LTE-Advanced (3GPP LTE-A) cellular uplink. The 3GPP LTE-A uplink allows for precoded multi-stream (precoded MIMO) transmission from each scheduled user and also allows flexible multi-user (
MU) scheduling wherein multiple users can be assigned the same time-frequency resource. However, exploiting these features is made challenging by certain practical constraints that have been imposed in order to maintain a low signaling overhead. We show that while the scheduling problem in the 3GPP LTE-A cellular uplink is NP-hard, it can be formulated as the maximization of a submodular set function subject to one matroid and multiple knapsack constraints. We then propose constant-factor polynomial-time approximation algorithms and demonstrate their superior performance via simulations.
Recent advances in the integration of vehicular sensor network (VSN) technology, and crowd sensing leveraging pervasive sensors called onboard units (OBUs), like smartphones and radio frequency IDentifications to provide sensing services, have attrac
ted increasing attention from both industry and academy. Nowadays, existing vehicular sensing applications lack good mechanisms to improve the maximum achievable throughput and minimizing service time of participating sensing OBUs in vehicular sensor networks. To fill these gaps, in this paper, first, we introduce real imperfect link states to the calculation of Markov chains. Second, we incorporate the result of different link states for multiple types of vehicles with the calculations of uplink throughput and service time. Third, in order to accurately calculate the service time of an OBU, we introduce the steady state probability to calculate the exact time of a duration for back-off decrement, rather than using the traditional relative probability. Additionally, to our best knowledge, we first explore a multichannel scheduling strategy of uplink data access in a single roadside unit (RSU) by using a non-cooperative game in a RSU coverage region to maximize the uplink throughput and minimize service time under saturated and unsaturated traffic loads. To this end, we conduct a theoretical analysis and find the equilibrium point of the scheduling. The numerical results show that the solution of the equilibrium points are consistent with optimization problems.
Cellular connected unmanned aerial vehicle (UAV) has been identified as a promising paradigm and attracted a surge of research interest recently. Although the nearly line-of-sight (LoS) channels are favorable to receive higher powers, UAV can in turn
cause severe interference to each other and to any other users in the same frequency band. In this contribution, we focus on the uplink communications of cellular-connected UAV. To cope with the severe interference among UAV-UEs, several different scheduling and power control algorithms are proposed to optimize the spectrum efficiency (SE) based on the geometrical programming (GP) principle together with the successive convex approximation (SCA) technique. The proposed schemes include maximizing the sum SE of UAVs, maximizing the minimum SE of UAVs, etc., applied in the frequency domain and/or the time domain. Moreover, the quality of service (QoS) constraint and the uplink single-carrier (SC) constraint are also considered. The performances of these power and resource allocation algorithms are evaluated via extensive simulations in both full buffer transmission mode and bursty traffic mode. Numerical results show that the proposed algorithms can effectively enhance the uplink SEs of cellular-connected UAVs.
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 tre
nds 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.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
