Statistical CSIT Aided User Scheduling for Broadcast MU-MISO System

Abstract: Recent studies show that the statistical channel state information (SCSI) helps to largely increase the capacity of communication systems when the instantaneous perfect CSI (IPCSI) is unavailable. In this paper, we consider multi-user multipleinput- single-output (MU-MISO) broadcast channels where the transmitter has the knowledge of SCSI. The major issue concerned in our work is to improve the average group-rate of the whole system by scheduling users over different time slots. With SCSI at the transmitter side, we are able to precode signals and hence compute the theoretical achievable group-rate of arbitrary user groups. Based on the group-rates, we propose tier-2 Munkres user scheduling algorithm (T2-MUSA) which leads to higher average group-rate than existing algorithms with generally better fairness. The optimality of the proposed algorithm in energy-fair user scheduling space is proved and we derive a lower bound of a special case to verify the validity of our simulations. In addition, many conventional user scheduling algorithms maintain queue stability by solving a weighted sum-rate (WSR) problem, using queue lengths to represent weight coefficients. Inspired by T2-MUSA we propose a QoS-based Munkres user scheduling algorithm (QB-MUSA) aimed at stabilizing queue lengths and maximizing throughput. In results, we show that QB-MUSA exhibits higher throughput than the conventional weighted sumrate (WSR) based algorithm

Massive MIMO Downlink Transmission for LEO Satellite Communications

We investigate the downlink (DL) transmit strategy for massive multiple-input multiple-output (MIMO) low-earthorbit (LEO) satellite communication (SATCOM) systems, in which only the slow-varying statistical channel state information is known at the transmitter side. First, we establish the massive MIMO LEO satellite channel model, in which the uniform planar arrays are deployed at both the satellite and user terminals (UTs). Building on the rank-one property of satellite channel matrices, we show that transmitting a single data stream to each UT is optimal for the ergodic sum rate maximization. This result is of great importance for massive MIMO LEO SATCOM systems, since the sophisticated design of transmit covariance matrices is turned into that of precoding vectors, with no loss of optimality at all. Furthermore, we conceive an algorithm to compute the precoding vectors. Simulation results show the significant performance gains of the proposed approaches over the previous schemes

Multiuser Downlink Beamforming Techniques for Cognitive Radio Networks

Spectrum expansion and a significant network densification are key elements in meeting the ever increasing demands in data rates and traffic loads of future communication systems. In this context, cognitive radio (CR) techniques, which sense and opportunistically use spectrum resources, as well as beamforming methods, which increase spectral efficiency by exploiting spatial dimensions, are particularly promising. Thus, the scope of this thesis is to propose efficient downlink (DL) beamforming and power allocation schemes, in a CR framework. The methods developed here, can be further applied to various practical scenarios such as hierarchical multi-tier, heterogenous or dense networks. In this work, the particular CR underlay paradigm is considered, according to which, secondary users (SUs) opportunistically use the spectrum held by primary users (PUs), without disturbing the operation of the latter. Developing beamforming algorithms, in this scenario, requires that channel state information (CSI) from both SUs and PUs is required at the BS. Since in CR networks PUs have typically limited or no cooperation with the SUs, we particularly focus on designing beamforming schemes based on statistical CSI, which can be obtained with limited or no feedback. To further meet the energy efficiency requirements, the proposed beamforming designs aim to minimize the transmitted power at the BS, which serves SUs at their desired Quality-of-Service (QoS), in form of Signal-to-interference-plus-noise (SINR), while respecting the interference requirements of the primary network. In the first stage, this problem is considered under the assumption of perfect CSI of both SUs and PUs. The difficulty of this problem consists on one hand, in its non-convexity and, on the other hand, in the fact that the beamformers are coupled in all constraints. State-of-the-art approaches are based on convex approximations, given by semidefinite relaxation (SDR) methods, and suffer from large computational complexity per iteration, as well as the drawback that optimal beamformers cannot always be retrieved from the obtained solutions. The approach, proposed in this thesis, aims to overcome these limitations by exploiting the structure of the problem. We show that the original downlink problem can be equivalently represented in a so called ’virtual’ uplink domain (VUL), where the beamformers and powers are allocated, such that uplink SINR constraints of the SUs are satisfied, while both SUs and PUs transmit to the BS. The resulting VUL problem has a simpler structure than the original formulation, as the beamformers are decoupled in the SINR constraints. This allows us to develop algorithms, which solve the original problem, with significantly less computational complexity than the state-of-the-art methods. The rigurous analysis of the Lagrange duality, performed next, exposes scenarios, in which the equivalence between VUL and DL problems can be theroretically proven and shows the relation between the obtained powers in the VUL domain and the optimal Lagrange multipliers, corresponding to the original problem. We further use the duality results and the intuition of the VUL reformulation, in the extended problem of joint admission control and beamforming. The aim of this is to find a maximal set of SUs, which can be jointly served, as well as the corresponding beamforming and power allocation. Our approach uses Lagrange duality, to detect infeasible cases and the intuition of the VUL reformulation to decide upon the users, which have the largest contribution to the infeasibiity of the problem. With these elements, we construct a deflation based algorithm for the joint beamforming and admission control problem, which benefits from low complexity, yet close to optimal perfomance. To make the method also suitable for dense networks, with a large number of SUs and PUs, a cluster aided approach is further proposed and consists in grouping users, based on their long term spatial signatures. The information in the clusters serves as an initial indication of the SUs which cannot be simultaneously served and the PUs which pose similar interference constraints to the BS. Thus, the cluster information can be used to significantly reduce the dimension of the problem in scenarios with large number of SUs and PUs, and this fact is further validated by extensive simulations. In the second part of this thesis, the practical case of imperfect covariance based CSI, available at the transmitter, is considered. To account for the uncertainty in the channel knowledge, a worst case approach is taken, in which the SINR and the interference constraints are considered for all CSI mismatches in a predefined set One important factor, which influences the performance of the worst case beamforming approach is a proper choice of the the defined uncertainty set, to accurately model the possible uncertainties in the CSI. In this thesis, we show that recently derived Riemannian distances are better suited to measure the mismatches in the statistical CSI than the commonly used Frobenius norms, as they better capture the properties of the covariance matrices, than the latter. Therefore, we formulate a novel worst case robust beamforming problem, in which the uncertainty set is bounded based on these measures and for this, we derive a convex approximation, to which a solution can be efficiently found in polynomial time. Theoretical and numerical results confirm the significantly better performance of our proposed methods, as compared to the state-of-the-art methods, in which Frobenius norms are used to bound the mismatches. The consistently better results of the designs utilizing Riemannian distances also manifest in scenarios with large number of users, where admission control techniques must supplement the beamforming design with imperfect CSI. Both benchmark methods as well as low complexity techniques, developed in this thesis to solve this problem, show that designs based on Riemannian distance outperform their competitors, in both required transmit power as well as number of users, which can be simultaneously served

Full-duplex wireless communications: challenges, solutions and future research directions

The family of conventional half-duplex (HD) wireless systems relied on transmitting and receiving in different time-slots or frequency sub-bands. Hence the wireless research community aspires to conceive full-duplex (FD) operation for supporting concurrent transmission and reception in a single time/frequency channel, which would improve the attainable spectral efficiency by a factor of two. The main challenge encountered in implementing an FD wireless device is the large power difference between the self-interference (SI) imposed by the device’s own transmissions and the signal of interest received from a remote source. In this survey, we present a comprehensive list of the potential FD techniques and highlight their pros and cons. We classify the SI cancellation techniques into three categories, namely passive suppression, analog cancellation and digital cancellation, with the advantages and disadvantages of each technique compared. Specifically, we analyse the main impairments (e.g. phase noise, power amplifier nonlinearity as well as in-phase and quadrature-phase (I/Q) imbalance, etc.) that degrading the SI cancellation. We then discuss the FD based Media Access Control (MAC)-layer protocol design for the sake of addressing some of the critical issues, such as the problem of hidden terminals, the resultant end-to-end delay and the high packet loss ratio (PLR) due to network congestion. After elaborating on a variety of physical/MAC-layer techniques, we discuss potential solutions conceived for meeting the challenges imposed by the aforementioned techniques. Furthermore, we also discuss a range of critical issues related to the implementation, performance enhancement and optimization of FD systems, including important topics such as hybrid FD/HD scheme, optimal relay selection and optimal power allocation, etc. Finally, a variety of new directions and open problems associated with FD technology are pointed out. Our hope is that this treatise will stimulate future research efforts in the emerging field of FD communication

Resource Allocation Management of D2D Communications in Cellular Networks

To improve the system capacity, spectral performance, and energy efficiency, stringent requirements for increasing reliability, and decreasing delays have been intended for next-generation wireless networks. Device-to-device (D2D) communication is a promising technique in the fifth-generation (5G) wireless communications to enhance spectral efficiency, reduce latency and energy efficiency. In D2D communication, two wireless devices in close proximity can communicate with each other directly without pass through the Base Station (BS) or Core Network (CN). In this proposal, we identify compromises and challenges of integrating D2D communications into cellular networks and propose potential solutions. To maximize gains from such integration, resource management, and interference avoidance are key factors. Thus, it is important to properly allocate resources to guarantee reliability, data rate, and increase the capacity in cellular networks. In this thesis, we address the problem of resource allocation in D2D communication underlaying cellular networks. We provide a detailed review of the resource allocation problem of D2D communications. My Ph.D research will tackle several issues in order to alleviate the interference caused by a D2D user-equipment (DUE) and cellular-userequipment (CUE) in uplink multi-cell networks, the intra-cell and inter-cell interference are considered in this work to improve performance for D2D communication underlaying cellular networks. The thesis consists of four main results. First, the preliminary research proposes a resource allocation scheme to formulate the resource allocation problem through optimization of the utility function, which eventually reflects the system performance concerning network throughput. The formulated optimization problem of maximizing network throughput while guaranteeing predefined service levels to cellular users is non-convex and hence intractable. Thus, the original problem is broken down into two stages. The first stage is the admission control of D2D users while the second one is the power control for each admissible D2D pair and its reuse partner. Second, we proposed a spectrum allocation framework based on Reinforcement Learning (RL) for joint mode selection, channel assignment, and power control in D2D communication. The objective is to maximize the overall throughput of the network while ensuring the quality of transmission and guaranteeing low latency requirements of D2D communications. The proposed algorithm uses reinforcement learning (RL) based on Markov Decision Process (MDP) with a proposed new reward function to learn the policy by interacting with the D2D environment. An Actor-Critic Reinforcement Learning (AC-RL) approach is then used to solve the resource management problem. The simulation results show that our learning method performs well, can greatly improve the sum rate of D2D links, and converges quickly, compared with the algorithms in the literature. Third, a joint channel assignment, power allocation and resource allocation algorithm is proposed. The algorithm designed to allow multiple DUEs to reuse the same CUE channel for D2D communications underlaying multi-cell cellular networks with the consideration of the inter-cell and intra-cell interferences. Obviously, under satisfying the QoS requirements of both DUEs and CUEs, the more the number of the allowed accessing DUEs on a single CUE channel is, the higher the spectrum efficiency is, and the higher the network throughput can be achieved. Meanwhile, implementing resource allocation strategies at D2D communications allows to effectively mitigate the interference caused by the D2D communications at both cellular and D2D users. In this part, the formulated optimization problem of maximizing network throughput while guaranteeing predefined service levels to cellular users. Therefore, we propose an algorithm that solves this nonlinear mixed-integer problem in three steps wherein the first step, subchannel assignment is carried out, the second one is the power allocation, while the third step of the proposed algorithm is the resource allocation for multiple D2D pairs based on genetic algorithm. The simulation results verify the effectiveness of our proposed algorithm. Fourth, integrating D2D communications and Femtocells in Heterogeneous Networks (HetNets) is a promising technology for future cellular networks. Which have attracted a lot of attention since it can significantly improve the capacity, energy efficiency and spectral performance of next-generation wireless networks (5G). D2D communication and femtocell are introduced as underlays to the cellular systems by reusing the cellular channels to maximize the overall throughput in the network. In this part, the problem is formulated to maximize the network throughput under the QoS constraints for CUEs, DUEs and FUEs. This problem is a mixed-integer non-linear problem that is difficult to be solved directly. To solve this problem, we propose a joint channel selection, power control, and resource allocation scheme to maximize the sum rate of the cellular network system. The simulation results show that the proposed scheme can effectively reduce the computational complexity and improve the overall system throughput compared with existing well-known methods

Journal of Telecommunications and Information Technology, nr 3

kwartalni