اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMulti-User MIMO Scheduling in the Fourth Generation Cellular Uplink
153
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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 modif
ied 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.
While mmWave bands provide a large bandwidth for mobile broadband services, they suffer from severe path loss and shadowing. Multiple-antenna techniques such as beamforming (BF) can be applied to compensate the signal attenuation. We consider a speci
al case of hybrid BF called per-stream hybrid BF (PSHBF) which is easier to implement than the general hybrid BF because it circumvents the need for joint analog-digital beamformer optimization. Employing BF at the base station enables the transmission of multiple data streams to several users in the same resource block. In this paper, we provide an offline study of proportional fair multi-user scheduling in a mmWave system with PSHBF to understand the impact of various system parameters on the performance. We formulate multi-user scheduling as an optimization problem. To tackle the non-convexity, we provide a feasible solution and show through numerical examples that the performance of the provided solution is very close to an upper-bound. Using this framework, we provide extensive numerical investigations revealing several engineering insights.
The robustness of system throughput with scheduling is a critical issue. In this paper, we analyze the sensitivity of multi-user scheduling performance to channel misreporting in systems with massive antennas. The main result is that for the round-ro
bin scheduler combined with max-min power control, the channel magnitude misreporting is harmful to the scheduling performance and has a different impact from the purely physical layer analysis. Specifically, for the homogeneous users that have equal average signal-to-noise ratios (SNRs), underreporting is harmful, while overreporting is beneficial to others. In underreporting, the asymptotic rate loss on others is derived, which is tight when the number of antennas is huge. One interesting observation in our research is that the rate loss periodically increases and decreases as the number of misreporters grows. For the heterogeneous users that have various SNRs, both underreporting and overreporting can degrade the scheduler performance. We observe that strong misreporting changes the user grouping decision and hence greatly decreases some users rates regardless of others gaining rate improvements, while with carefully designed weak misreporting, the scheduling decision keeps fixed and the rate loss on others is shown to grow nearly linearly with the number of misreporters.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
