698 research outputs found

    A Soft Computing Approach to Dynamic Load Balancing in 3GPP LTE

    Get PDF
    A major objective of the 3GPP LTE standard is the provision of high-speed data services. These services must be guaranteed under varying radio propagation conditions, to stochastically distributed mobile users. A necessity for determining and regulating the traffic load of eNodeBs naturally ensues. Load balancing is a self-optimization operation of self-organizing networks (SON). It aims at ensuring an equitable distribution of users in the network. This translates into better user satisfaction and a more efficient use of network resources. Several methods for load balancing have been proposed. Most of the algorithms are based on hard (traditional) computing which does not utilize the tolerance for precision of load balancing. This paper proposes the use of soft computing, precisely adaptive Neuro-fuzzy inference system (ANFIS) model for dynamic QoS aware load balancing in 3GPP LTE. The use of ANFIS offers learning capability of neural network and knowledge representation of fuzzy logic for a load balancing solution that is cost effective and closer to human intuitio

    Hybrid Iterative Multiuser Detection for Channel Coded Space Division Multiple Access OFDM Systems

    No full text
    Space division multiple access (SDMA) aided orthogonal frequency division multiplexing (OFDM) systems assisted by efficient multiuser detection (MUD) techniques have recently attracted intensive research interests. The maximum likelihood detection (MLD) arrangement was found to attain the best performance, although this was achieved at the cost of a computational complexity, which increases exponentially both with the number of users and with the number of bits per symbol transmitted by higher order modulation schemes. By contrast, the minimum mean-square error (MMSE) SDMA-MUD exhibits a lower complexity at the cost of a performance loss. Forward error correction (FEC) schemes such as, for example, turbo trellis coded modulation (TTCM), may be efficiently combined with SDMA-OFDM systems for the sake of improving the achievable performance. Genetic algorithm (GA) based multiuser detection techniques have been shown to provide a good performance in MUD-aided code division multiple access (CDMA) systems. In this contribution, a GA-aided MMSE MUD is proposed for employment in a TTCM assisted SDMA-OFDM system, which is capable of achieving a similar performance to that attained by its optimum MLD-aided counterpart at a significantly lower complexity, especially at high user loads. Moreover, when the proposed biased Q-function based mutation (BQM) assisted iterative GA (IGA) MUD is employed, the GA-aided system’s performance can be further improved, for example, by reducing the bit error ratio (BER) measured at 3 dB by about five orders of magnitude in comparison to the TTCM assisted MMSE-SDMA-OFDM benchmarker system, while still maintaining modest complexity

    Dynamic Interference Mitigation for Generalized Partially Connected Quasi-static MIMO Interference Channel

    Full text link
    Recent works on MIMO interference channels have shown that interference alignment can significantly increase the achievable degrees of freedom (DoF) of the network. However, most of these works have assumed a fully connected interference graph. In this paper, we investigate how the partial connectivity can be exploited to enhance system performance in MIMO interference networks. We propose a novel interference mitigation scheme which introduces constraints for the signal subspaces of the precoders and decorrelators to mitigate "many" interference nulling constraints at a cost of "little" freedoms in precoder and decorrelator design so as to extend the feasibility region of the interference alignment scheme. Our analysis shows that the proposed algorithm can significantly increase system DoF in symmetric partially connected MIMO interference networks. We also compare the performance of the proposed scheme with various baselines and show via simulations that the proposed algorithms could achieve significant gain in the system performance of randomly connected interference networks.Comment: 30 pages, 10 figures, accepted by IEEE Transaction on Signal Processin

    Adaptive Neuro-Fuzzy Inference System for Dynamic Load Balancing in 3GPP LTE

    Get PDF
    ANFIS is applicable in modeling of key parameters when investigating the performance and functionality of wireless networks. The need to save both capital and operational expenditure in the management of wireless networks cannot be over-emphasized. Automation of network operations is a veritable means of achieving the necessary reduction in CAPEX and OPEX. To this end, next generations networks such WiMAX and 3GPP LTE and LTE-Advanced provide support for self-optimization, self-configuration and self-healing to minimize human-to-system interaction and hence reap the attendant benefits of automation. One of the most important optimization tasks is load balancing as it affects network operation right from planning through the lifespan of the network. Several methods for load balancing have been proposed. While some of them have a very buoyant theoretical basis, they are not practically implementable at the current state of technology. Furthermore, most of the techniques proposed employ iterative algorithm, which in itself is not computationally efficient. This paper proposes the use of soft computing, precisely adaptive neuro-fuzzy inference system for dynamic QoS-aware load balancing in 3GPP LTE. Three key performance indicators (i.e. number of satisfied user, virtual load and fairness distribution index) are used to adjust hysteresis task of load balancing

    Sparse Signal Processing Concepts for Efficient 5G System Design

    Full text link
    As it becomes increasingly apparent that 4G will not be able to meet the emerging demands of future mobile communication systems, the question what could make up a 5G system, what are the crucial challenges and what are the key drivers is part of intensive, ongoing discussions. Partly due to the advent of compressive sensing, methods that can optimally exploit sparsity in signals have received tremendous attention in recent years. In this paper we will describe a variety of scenarios in which signal sparsity arises naturally in 5G wireless systems. Signal sparsity and the associated rich collection of tools and algorithms will thus be a viable source for innovation in 5G wireless system design. We will discribe applications of this sparse signal processing paradigm in MIMO random access, cloud radio access networks, compressive channel-source network coding, and embedded security. We will also emphasize important open problem that may arise in 5G system design, for which sparsity will potentially play a key role in their solution.Comment: 18 pages, 5 figures, accepted for publication in IEEE Acces

    Frequency Domain Backoff for Continuous Beamforming Space Division Multiple Access on Massive MIMO Wireless Backhaul Systems

    Get PDF
    This paper newly proposes a frequency domain backoff scheme dedicated to continuous beamforming space division multiple access (CB-SDMA) on massive antenna systems for wireless entrance (MAS-WE). The entrance base station (EBS) has individual base band signal processing units for respective relay stations (RSs) to be accommodated. EBS then continuously applies beamforming weight to transmission/reception signals. CB-SDMA yields virtual point-to-point backhaul link where radio resource control messages and complicated multiuser scheduling are not required. This simplified structure allows RSs to work in a distributed manner. However, one issue remains to be resolved; overloaded multiple access resulting in collision due to its random access nature. The frequency domain backoff mechanism is introduced instead of the time domain one. It can flexibly avoid co-channel interference caused by excessive spatial multiplexing. Computer simulation verifies its superiority in terms of system throughput and packet delay

    Multiple Access in Aerial Networks: From Orthogonal and Non-Orthogonal to Rate-Splitting

    Get PDF
    Recently, interest on the utilization of unmanned aerial vehicles (UAVs) has aroused. Specifically, UAVs can be used in cellular networks as aerial users for delivery, surveillance, rescue search, or as an aerial base station (aBS) for communication with ground users in remote uncovered areas or in dense environments requiring prompt high capacity. Aiming to satisfy the high requirements of wireless aerial networks, several multiple access techniques have been investigated. In particular, space-division multiple access(SDMA) and power-domain non-orthogonal multiple access (NOMA) present promising multiplexing gains for aerial downlink and uplink. Nevertheless, these gains are limited as they depend on the conditions of the environment. Hence, a generalized scheme has been recently proposed, called rate-splitting multiple access (RSMA), which is capable of achieving better spectral efficiency gains compared to SDMA and NOMA. In this paper, we present a comprehensive survey of key multiple access technologies adopted for aerial networks, where aBSs are deployed to serve ground users. Since there have been only sporadic results reported on the use of RSMA in aerial systems, we aim to extend the discussion on this topic by modelling and analyzing the weighted sum-rate performance of a two-user downlink network served by an RSMA-based aBS. Finally, related open issues and future research directions are exposed.Comment: 16 pages, 6 figures, submitted to IEEE Journa

    Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks

    Full text link
    We consider a user-centric scalable cell-free massive MIMO network with a total of LMLM distributed remote radio unit antennas serving KK user equipments (UEs). Many works in the current literature assume LM≫KLM\gg K, enabling high UE data rates but also leading to a system not operating at its maximum performance in terms of sum throughput. We provide a new perspective on cell-free massive MIMO networks, investigating rate allocation and the UE density regime in which the network makes use of its full capability. The UE density KK approximately equal to LM2\frac{LM}{2} is the range in which the system reaches the largest sum throughput. In addition, there is a significant fraction of UEs with relatively low throughput, when serving K>LM2K>\frac{LM}{2} UEs simultaneously. We propose to reduce the number of active UEs per time slot, such that the system does not operate at ``full load'', and impose throughput fairness among all users via a scheduler designed to maximize a suitably defined concave componentwise non-decreasing network utility function. Our numerical simulations show that we can tune the system such that a desired distribution of the UE throughput, depending on the utility function, is achieved

    A Generalized Cluster-Free NOMA Framework Towards Next-Generation Multiple Access

    Full text link
    A generalized downlink multi-antenna non-orthogonal multiple access (NOMA) transmission framework is proposed with the novel concept of cluster-free successive interference cancellation (SIC). In contrast to conventional NOMA approaches, where SIC is successively carried out within the same cluster, the key idea is that the SIC can be flexibly implemented between any arbitrary users to achieve efficient interference elimination. Based on the proposed framework, a sum rate maximization problem is formulated for jointly optimizing the transmit beamforming and the SIC operations between users, subject to the SIC decoding conditions and users' minimal data rate requirements. To tackle this highly-coupled mixed-integer nonlinear programming problem, an alternating direction method of multipliers-successive convex approximation (ADMM-SCA) algorithm is developed. The original problem is first reformulated into a tractable biconvex augmented Lagrangian (AL) problem by handling the non-convex terms via SCA. Then, this AL problem is decomposed into two subproblems that are iteratively solved by the ADMM to obtain the stationary solution. Moreover, to reduce the computational complexity and alleviate the parameter initialization sensitivity of ADMM-SCA, a Matching-SCA algorithm is proposed. The intractable binary SIC operations are solved through an extended many-to-many matching, which is jointly combined with an SCA process to optimize the transmit beamforming. The proposed Matching-SCA can converge to an enhanced exchange-stable matching that guarantees the local optimality. Numerical results demonstrate that: i) the proposed Matching-SCA algorithm achieves comparable performance and a faster convergence compared to ADMM-SCA; ii) the proposed generalized framework realizes scenario-adaptive communications and outperforms traditional multi-antenna NOMA approaches in various communication regimes.Comment: 30 pages, 9 figures, submitted to IEEE TW
    • …
    corecore