User relay assisted traffic shifting in LTE-advanced systems

In order to deal with uneven load distribution, mobility load balancing adjusts the handover region to shift edge users from a hot-spot cell to the less-loaded neighbouring cells. However, shifted users suffer the reduced signal power from neighbouring cells, which may result in link quality degradation. This paper employs a user relaying model and proposes a user relay assisted traffic shifting (URTS) scheme to deal with the above problem. In URTS, a shifted user selects a suitable non-active user as relay user to forward data, thus enhancing the link quality of the shifted user. Since the user relaying model consumes relay user’s energy, a utility function is designed in relay selection to reach a trade-off between the shifted user’s link quality improvement and the relay user’s energy consumption. Simulation results show that URTS scheme could improve SINR and throughput of shifted users. Also, URTS scheme keeps the cost of relay user’s energy consumption at an acceptable level

A survey of self organisation in future cellular networks

This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks

Two-Way Relaying Cooperative Wireless Networks: Resource Allocation and Performance Analysis

Relay-based cooperative wireless networks have been widely considered one of the cost-effective solutions to meet the demands in future wireless networks. In order to maximize the overall sum-rate while maintaining proportional fairness among users, we investigate different resource allocation algorithms in two-way relay networks with analog network coding (ANC) protocol and time division broadcast (TDBC) protocol. The algorithms investigated are different from traditional proportional fairness schemes in terms of fairness and computational complexity as we have applied Access Proportional Fairness (APF) and Minimum Rate Proportional Fairness (MRPF) along with load balancing at the relays. A MATLAB simulation has been performed and simulation results show the effectiveness of these algorithms

Self-Organising Load Balancing for OFDMA Cellular Networks

In this thesis, self-organising load balancing is investigated to deal with the uneven load distribution in OFDMA based cellular networks. In single-hop cellular networks, a self- organising cluster-based cooperative load balancing (CCLB) scheme is proposed to overcome the ‘virtual partner’ and the ‘aggravating load’ problems confronted in the conventional mobility load balancing schemes. Theoretical analysis and simulation results show that the proposed scheme can effectively reduce the call blocking probability, the handover failure rate, and the hot-spot cell’s load. The proposed CCLB scheme consists of two stages: partner cell selection and traffic shifting. In the partner cell selection stage, a user-vote assisted clustering algorithm is proposed, which jointly considers the users’ channel condition and the surrounding cells’ load. This algorithm can select appropriate neighbouring cells as partners to construct the load balancing cluster, and deal with the ‘virtual partner’ problem. In the traffic shifting stage, a relative load response model (RLRM) is designed. RLRM coordinates multiple hot-spot cells’ shifting traffic towards their public partner, thus mitigating the ‘aggravating load’ problem of the public partner. Moreover, a traffic offloading optimisation algorithm is proposed to balance the hot-spot cell’s load within the load balancing cluster and to minimise its partners’ average call blocking probability. The CCLB scheme is modified to apply in multi-hop cellular networks with relays deployed. Both fixed relay and mobile user relay scenarios are considered. For fixed relay cellular networks, a relay-level user shifting algorithm is proposed. This algorithm jointly considers users’ channel condition and spectrum usage of fixed relay, in order to reduce the handover failure rate and deal with the ‘aggravating load’ problem of fixed relay. In the mobile user relay scenario, the user relaying assisted traffic shifting algorithm is proposed to improve the link quality of shifted edge users, which brings about an increase in the achievable rate of shifted edge users and decrease in the handover failure rate

Recent advances in radio resource management for heterogeneous LTE/LTE-A networks

As heterogeneous networks (HetNets) emerge as one of the most promising developments toward realizing the target specifications of Long Term Evolution (LTE) and LTE-Advanced (LTE-A) networks, radio resource management (RRM) research for such networks has, in recent times, been intensively pursued. Clearly, recent research mainly concentrates on the aspect of interference mitigation. Other RRM aspects, such as radio resource utilization, fairness, complexity, and QoS, have not been given much attention. In this paper, we aim to provide an overview of the key challenges arising from HetNets and highlight their importance. Subsequently, we present a comprehensive survey of the RRM schemes that have been studied in recent years for LTE/LTE-A HetNets, with a particular focus on those for femtocells and relay nodes. Furthermore, we classify these RRM schemes according to their underlying approaches. In addition, these RRM schemes are qualitatively analyzed and compared to each other. We also identify a number of potential research directions for future RRM development. Finally, we discuss the lack of current RRM research and the importance of multi-objective RRM studies

A coalitional game-based relay load balancing and power allocation scheme in decode-and-forward cellurlar relay networks

In this paper, a game theoretic relay load balancing and power allocationscheme is proposed for downlink transmission in a decode-and-forward orthogonal frequency division multiple access-based cellular relay network. A system with a base station communicating with multiple users via multiple relays is considered. The relays have limited power, which must be divided among the users they support. In traditional scheme, each relay simply divides its transmit power equally among all its users. Moreover, each user selects the relay with the highest channel gain. In this work, we do not apply the traditional relay scheme. It is because the users are distributed randomly, and by applying the traditional relay selection scheme, it may happen that some relays have more users connected to them than other relays, which results in having unbalanced load among the relays. In order to avoid performance degradation, achieve relay load balancing, and maximize the total data rate of the network, a game theoretic approach is proposed, which efficiently assigns the users to relays. The power of each relay is wisely distributed among users by the efficient power allocation scheme. Simulation results indicate that the proposed game-based scheme can considerably improve the average sum-spectral efficiency. Moreover, it shows that by applying the game, users who can connect to uncongested relays join them as opposed to connecting to congested relays.Grant from the Natural Sciences and Engineering Research Council (NSERC) IRC and Bell Canada.http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1530-86772017-06-30hb2016Electrical, Electronic and Computer Engineerin

Energy efficiency and interference management in long term evolution-advanced networks.

Doctoral Degree. University of KwaZulu-Natal, Durban.Cellular networks are continuously undergoing fast extraordinary evolution to overcome technological challenges. The fourth generation (4G) or Long Term Evolution-Advanced (LTE-Advanced) networks offer improvements in performance through increase in network density, while allowing self-organisation and self-healing. The LTE-Advanced architecture is heterogeneous, consisting of different radio access technologies (RATs), such as macrocell, smallcells, cooperative relay nodes (RNs), having various capabilities, and coexisting in the same geographical coverage area. These network improvements come with different challenges that affect users’ quality of service (QoS) and network performance. These challenges include; interference management, high energy consumption and poor coverage of marginal users. Hence, developing mitigation schemes for these identified challenges is the focus of this thesis. The exponential growth of mobile broadband data usage and poor networks’ performance along the cell edges, result in a large increase of the energy consumption for both base stations (BSs) and users. This due to improper RN placement or deployment that creates severe inter-cell and intracell interferences in the networks. It is therefore, necessary to investigate appropriate RN placement techniques which offer efficient coverage extension while reducing energy consumption and mitigating interference in LTE-Advanced femtocell networks. This work proposes energy efficient and optimal RN placement (EEORNP) algorithm based on greedy algorithm to assure improved and effective coverage extension. The performance of the proposed algorithm is investigated in terms of coverage percentage and number of RN needed to cover marginalised users and found to outperform other RN placement schemes. Transceiver design has gained importance as one of the effective tools of interference management. Centralised transceiver design techniques have been used to improve network performance for LTE-Advanced networks in terms of mean square error (MSE), bit error rate (BER) and sum-rate. The centralised transceiver design techniques are not effective and computationally feasible for distributed cooperative heterogeneous networks, the systems considered in this thesis. This work proposes decentralised transceivers design based on the least-square (LS) and minimum MSE (MMSE) pilot-aided channel estimations for interference management in uplink LTE-Advanced femtocell networks. The decentralised transceiver algorithms are designed for the femtocells, the macrocell user equipments (MUEs), RNs and the cell edge macrocell UEs (CUEs) in the half-duplex cooperative relaying systems. The BER performances of the proposed algorithms with the effect of channel estimation are investigated. Finally, the EE optimisation is investigated in half-duplex multi-user multiple-input multiple-output (MU-MIMO) relay systems. The EE optimisation is divided into sub-optimal EE problems due to the distributed architecture of the MU-MIMO relay systems. The decentralised approach is employed to design the transceivers such as MUEs, CUEs, RN and femtocells for the different sub-optimal EE problems. The EE objective functions are formulated as convex optimisation problems subject to the QoS and transmit powers constraints in case of perfect channel state information (CSI). The non-convexity of the formulated EE optimisation problems is surmounted by introducing the EE parameter substractive function into each proposed algorithms. These EE parameters are updated using the Dinkelbach’s algorithm. The EE optimisation of the proposed algorithms is achieved after finding the optimal transceivers where the unknown interference terms in the transmit signals are designed with the zero-forcing (ZF) assumption and estimation errors are added to improve the EE performances. With the aid of simulation results, the performance of the proposed decentralised schemes are derived in terms of average EE evaluation and found to be better than existing algorithms