Mean User Throughput Research Articles

Radio Environment Map Based Inter-Cell Interference Coordination for Massive-MIMO Systems

Massive-MIMO (M-MIMO) allows to schedule users with high gain narrow beams and to reduce intra-cell inter-beam interference. Close to cell edge, users may experience high interference from beams of neighboring cells which degrades their performance. This paper introduces low complexity inter-cell interference coordination between neighboring cells for M-MIMO systems implementing Grid of Beams (GoB) using Radio Environment Maps (REMs). The REMs are designed using the Kriging with the Covariance Tapering spatial interpolation technique and are created for the serving and the interfering beams. The interference coordination is introduced as constraints to the schedulers that avoid simultaneous scheduling of users served by highly interfering beams from the neighboring cells. The coordination decision is based on information retrieved from REMs and its quality depends on the REMs' precision. Around 72 percent performance gain in terms of mean user throughput is achieved by the REM based coordination with respect to a baseline solution without coordination, and around 40 percent gain with respect to a state of the art solution that implements coordination using information at beam level resolution.

A novel low-complexity power allocation algorithm based on the NOMA system in a low-speed environment

For future wireless communication systems, Power Domain Non-Orthogonal Multiple Access (PD-NOMA) using an advanced receiver has been considered as a promising radio access technology candidate. Power allocation plays an important role in the PD-NOMA system because it considerably affects the total throughput and Geometric Mean User Throughput (GMUT) performance. However, most existing studies have not completely accounted for the computational complexity of the power allocation process when the User Terminals (UTs) move in a slow fading channel environment. To resolve such problems, a power allocation method is proposed to considerably reduce the search space of a Full Search Power (FSP) allocation algorithm. The initial power reallocation coefficients will be set to start with former optimal values by the proposed Lemma before searching for optimal power reallocation coefficients based on total throughput performance. Step size and correction granularity will be adjusted within a much narrower power search range while invalid power combinations may be reasonably discarded during the search process. The simulation results show that the proposed power reallocation scheme can greatly reduce computational complexity while the total throughput and GMUT performance loss are not greater than 1.5% compared with the FSP algorithm.

Fine-Grained Frequency Reuse in Centralized Small Cell Networks

Interference management for Small Cell (SC) networks has drawn great attention from both academia and industry due to its importance in Long-Term Evolution (LTE) and emerging 5G networks. Although various approaches have been proposed in the literature, many of them face practical limitations such as showing gains only in specific scenarios, relying on ideal fronthaul, or becoming computationally intractable as the network size increases. In this paper, a novel framework is proposed for interference management in centralized SC networks by jointly utilizing graph theory and optimization theory. It extends the classic center-edge frequency reuse schemes into a more fine-grained scale, thus capturing the complex interference relationships in SC networks. The cell-level resource partition can be semi-statically updated according to the traffic dynamics while existing Medium Access Control (MAC) schedulers can be used for subframe-level resource allocation, not requiring fiber fronthaul. LTE system-level simulation results show that the proposed scheme can significantly improve both cell edge and mean user throughput with practical complexity.

FFR TEKNİĞİ KULLANILAN ÇOK HÜCRELİ LTE-A SİSTEMLERİNDE KAYNAK ATAMA ALGORİTMALARININ KARŞILAŞTIRILMASI

The purpose of resource allocation in LTE-A (Long Term Evolution Advanced) systems is that the time frequency resource can be used effectively by the users according to specific parameters. Scheduling algorithms are used to efficiently allocate system resources among users. In this study, when allocating frequency among cells in multi-cell LTE-A systems, the Fractional Frequency Reuse (FFR) technique, a static ICIC (Intercell Interference Coordination) technique, was first used for GPF (Generalized Proportional Fair) and AMM (Arithmetic Mean Method) schedulers. BCQI (Best Channel Quality Indicator, RR (Round Robin) and PF (Proportional Fair), AMM and GPF schedulers were compared in terms of mean user throughput, edge user throughput, peak user throughput and fairness. As a result of the simulations, it was observed that GPF schedulers increased edge user throughputs and system fairness compared to other schedulers in case of using FFR in multicellular LTE-A systems.

A Packet Scheduling Scheme for Improving Real-time Applications Performance in Downlink LTE–advanced

Quality of Service based packet scheduling is a key-feature of LTE-A mandating selection and transmission of individual user packets based on their priority. HARQ Aware Scheduling, Retransmission Aware Proportional Fair, Chase Combining Based Max C/I Scheduling and Maximum- Largest Weighted First (M-LWDF) are popular Packet Scheduling Algorithms (PSAs) developed to meet QoS requirements. In highly erroneous LTE-A cannel, M-LWDF is considered to be one of best PSA. To validate the performance of M-LWDF for the LTE-A channel, Mean User Throughout, and Fairness performance measures were evaluated for 3 different PSAs designed based on M-LWDF algorithm in this paper. A C++ based simulation results indicate the superiority of the PSA3 algorithm within the threshold of the performance measures against benchmarks. It has shown more efficiency and the performance of RTA traffic was enhanced. Results show that PSA3 is superior to its benchmark PSA2 by 12% in Mean User Throughput and 11% in Fairness. PSA2 performed the worst because it prioritizes new users and it allocated all available RBs to the scheduled user leaving the rest to wait in the buffer. PSA3 maintians good Mean User Throughput and fairnessdue to scheduling each user on its RB which leads to multi-user diversity.

A Packet Scheduling Scheme for Improving Real-time Applications Performance in Downlink LTE–advanced

Quality of Service based packet scheduling is a key-feature of LTE-A mandating selection and transmission of individual user packets based on their priority. HARQ Aware Scheduling, Retransmission Aware Proportional Fair, Chase Combining Based Max C/I Scheduling and Maximum- Largest Weighted First (M-LWDF) are popular Packet Scheduling Algorithms (PSAs) developed to meet QoS requirements. In highly erroneous LTE-A cannel, M-LWDF is considered to be one of best PSA. To validate the performance of M-LWDF for the LTE-A channel, Mean User Throughout, and Fairness performance measures were evaluated for 3 different PSAs designed based on M-LWDF algorithm in this paper. A C++ based simulation results indicate the superiority of the PSA3 algorithm within the threshold of the performance measures against benchmarks. It has shown more efficiency and the performance of RTA traffic was enhanced. Results show that PSA3 is superior to its benchmark PSA2 by 12% in Mean User Throughput and 11% in Fairness. PSA2 performed the worst because it prioritizes new users and it allocated all available RBs to the scheduled user leaving the rest to wait in the buffer. PSA3 maintians good Mean User Throughput and fairnessdue to scheduling each user on its RB which leads to multi-user diversity.

Maximum-Largest Weighted Delay First Algorithm for Heterogeneous Traffic in 4G Networks

Real time applications with strict QoS like delay sensitive applications require an advanced technology to adopt them. This is where Long Term Evolution-Advanced (LTE-A) fulfills this requirement. With this ever evolving technology the need for improvements is required. Packet scheduling is one of the important key features of LTE-A, where it dictates user selection and transmission of those user’s packets based on the priority of the users to reach the receiver correctly. Packet scheduling is one mean to achieve those QoS requirements that real-time applications require. Such algorithms are HARQ Aware Scheduling Algorithm (HAS), Retransmission Aware Proportional Fair Algorithm (RAPF), Chase Combining Based Max C/I Scheduling and Maximum- Largest WeightedDealy First algorithm (M-LWDF). In this paper, M-LWDF is one of the best algorithms in LTE-A which was chosen for further investigated to support QoS in high mobility environment. Packet Loss Ratio (PLR), and Mean User Throughput performance measures were used to validate the performance of M-LWDF algorithm against other algorithms using similar mobile environment. Simulation results indicate the capability of M-LWDF algorithm within the threshold of the performance measures against other benchmarks where it has demonstrated more efficiency to support and improve the performance of real-time multimedia traffic.

Maximum-Largest Weighted Delay First Algorithm for Heterogeneous Traffic in 4G Networks

Real time applications with strict QoS like delay sensitive applications require an advanced technology to adopt them. This is where Long Term Evolution-Advanced (LTE-A) fulfills this requirement. With this ever evolving technology the need for improvements is required. Packet scheduling is one of the important key features of LTE-A, where it dictates user selection and transmission of those user’s packets based on the priority of the users to reach the receiver correctly. Packet scheduling is one mean to achieve those QoS requirements that real-time applications require. Such algorithms are HARQ Aware Scheduling Algorithm (HAS), Retransmission Aware Proportional Fair Algorithm (RAPF), Chase Combining Based Max C/I Scheduling and Maximum- Largest WeightedDealy First algorithm (M-LWDF). In this paper, M-LWDF is one of the best algorithms in LTE-A which was chosen for further investigated to support QoS in high mobility environment. Packet Loss Ratio (PLR), and Mean User Throughput performance measures were used to validate the performance of M-LWDF algorithm against other algorithms using similar mobile environment. Simulation results indicate the capability of M-LWDF algorithm within the threshold of the performance measures against other benchmarks where it has demonstrated more efficiency to support and improve the performance of real-time multimedia traffic.

Multi-Criteria Handover Using Modified Weighted TOPSIS Methods for Heterogeneous Networks

Ultra-dense small cell deployment in future 5G networks is a promising solution to the ever increasing demand of capacity and coverage. However, this deployment can lead to severe interference and high number of handovers, which in turn cause increased signaling overhead. In order to ensure service continuity for mobile users, minimize the number of unnecessary handovers and reduce the signaling overhead in heterogeneous networks, it is important to model adequately the handover decision problem. In this paper, we model the handover decision based on the multiple attribute decision making method, namely Technique for Order Preference by Similarity to Ideal Solution (TOPSIS). The base stations are considered as alternatives, and the handover metrics are considered as attributes to selecting the proper base station for handover. In this paper, we propose two modified TOPSIS methods for the purpose of handover management in the heterogeneous network. The first method incorporates the entropy weighting technique for handover metrics weighting. The second proposed method uses a standard deviation weighting technique to score the importance of each handover metric. Simulation results reveal that the proposed methods outperformed the existing methods by reducing the number of frequent handovers and radio link failures, in addition to enhancing the achieved mean user throughput.

Performance of Non-orthogonal Multiple Access with SIC in Cellular Downlink Using Proportional Fair-Based Resource Allocation

This paper investigates the system-level throughput of non-orthogonal multiple access (NOMA) with a successive interference canceller (SIC) in the cellular downlink assuming proportional fair (PF)-based radio resource (bandwidth and transmission power) allocation. The purpose of this study is to examine the possibility of applying NOMA with a SIC to the systems beyond the 4G cellular system. Both the mean and cell-edge user throughput are important in a real system. PF-based scheduling is known to achieve a good tradeoff between them by maximizing the product of the user throughput among users within a cell. In NOMA with a SIC, the scheduler allocates the same frequency to multiple users simultaneously, which necessitates multiuser scheduling. To achieve a better tradeoff between the mean and cell-edge user throughput, we propose and compare three power allocation strategies among users, which are jointly implemented with multiuser scheduling. Extensive simulation results show that NOMA with a SIC with a moderate number of non-orthogonally multiplexed users significantly enhances the system-level throughput performance compared to orthogonal multiple access (OMA), which is widely used in 3.9 and 4G mobile communication systems.

A Novel Low Computational Complexity Power Assignment Method for Non-orthogonal Multiple Access Systems

Multiple access (MA) technology is of most importance for beyond long term evolution (LTE) system. Non-orthogonal multiple access (NOMA) utilizing power domain and advanced receiver has been considered as a candidate MA technology recently. In this paper, power assignment method, which plays a key role in performance of NOMA, is investigated. The power assignment on the basis of maximizing geometric mean user throughput requires exhaustive search and thus has an unacceptable computational complexity for practical systems. To solve this problem, a novel power assignment method is proposed by exploiting tree search and characteristic of serial interference cancellation (SIC) receiver. The proposed method achieves the same performance as the exhaustive search while greatly reduces the computational complexity. On the basis of the proposed power assignment method, the performance of NOMA is investigated by link-level and system-level simulations in order to provide insight into suitability of using NOMA for future MA. Simulation results verify effectiveness of the proposed power assignment method and show NOMA is a very promising MA technology for beyond LTE system.

Rate Adaptive Resource Allocation and Utility-Based Packet Scheduling in Multicarrier Systems

There are several approaches for Radio Resource Management (RRM) in multicarrier cellular systems. This work analyzes and compares two of them: rate-adaptive resource allocation (sub-carriers and power) based on instantaneous data rates, and utility-based packet scheduling based on average data rates. A fundamental RRM problem in wireless cellular networks was chosen as a background to evaluate the aforementioned approaches: the trade-off between system spectral efficiency and fairness among the users when opportunistic allocation is used. Extensive system-level simulations were performed and important network metrics such as total cell throughput, mean user throughput, system fairness index and user satisfaction were assessed. It was concluded from the simulation results that it is possible to achieve an efficient trade-off between resource efficiency and fairness using any of the two RRM approaches. However, utility-based packet scheduling algorithms based on average data rates have the advantage of presenting higher user satisfaction with less computational complexity.