Joint source and relay optimization for interference MIMO relay networks

This paper considers multiple-input multiple-output (MIMO) relay communication in multi-cellular (interference) systems in which MIMO source-destination pairs communicate simultaneously. It is assumed that due to severe attenuation and/or shadowing effects, communication links can be established only with the aid of a relay node. The aim is to minimize the maximal mean-square-error (MSE) among all the receiving nodes under constrained source and relay transmit powers. Both one- and two-way amplify-and-forward (AF) relaying mechanisms are considered. Since the exactly optimal solution for this practically appealing problem is intractable, we first propose optimizing the source, relay, and receiver matrices in an alternating fashion. Then we contrive a simplified semidefinite programming (SDP) solution based on the error covariance matrix decomposition technique, avoiding the high complexity of the iterative process. Numerical results reveal the effectiveness of the proposed schemes

Robust Secrecy Beamforming for MIMO SWIPT with Probabilistic Constraints

This paper considers simultaneous wireless information apower transfer (SWIPT) in a multiple-input multiple-output (MIMO) wiretapnd power transfer (SWIPT) in a multiple-input multiple-output (MIMO) wiretap channel with energy harvesting receivers. The main objective is to keep the probability of the legitimate user's achievable secrecy rate outage as well as the energy receivers' harvested energy outage as caused by CSI uncertainties below given thresholds. This probabilistic-constrained secrecy rate maximization problem presents a significant analytical and computational challenge since any closed-form for the probabilistic constraints with log-det functions is intractable. In this paper, we address this challenging issue using codeviation inequalitiesnvex restrictions. In particular, we derive decomposition-based large deviation inequalities to transform the probabilistic constraints into second-order cone (SOC) constraints which are easier to handle. Then we show that a robust safe solution can be obtained through solving two convex sub-problems in an alternating fashion

Energy harvesting enabled MIMO relaying through power splitting

This paper considers a multiple-input multiple-output (MIMO) relay system with an energy harvesting relay node powered by harvesting energy from the source node using power splitting (PS). The rate maximization problem subject to power constraints at both the source and relay nodes is considered for two different scenarios. Firstly, the relay matrix and PS ratio are jointly optimized with uniform source precoding and then in the second scenario the source covariance is optimized as well. Iterative approaches and dual decomposition are proposed based on the structures of the optimal relay and source covariance matrices for the scenarios

Two-way beamforming optimization for full-duplex SWIPT systems

In this paper, we investigate the problem of two-way relay beamforming optimization to maximize the achievable sum-rate of a simultaneous wireless information and power transfer (SWIPT) system with a full-duplex (FD) multiple-input multiple-output (MIMO) amplify-and-forward (AF) relay. In particular, we address the optimal joint design of the receiver power splitting (PS) ratio and the beamforming matrix at the relay node given the channel state information (CSI). Our contribution is an iterative algorithm based on difference of convex (DC) programming and one-dimensional searching to achieve the joint optimal solution. Simulation results are provided to demonstrate the effectiveness of the proposed algorithm

Truth-Telling Mechanism for Two-Way Relay Selection for Secrecy Communications With Energy-Harvesting Revenue

This paper brings the novel idea of paying the utility to the winning agents in terms of some physical entity in cooperative communications. Our setting is a secret two-way communication channel where two transmitters exchange information in the presence of an eavesdropper. The relays are selected from a set of interested parties, such that the secrecy sum rate is maximized. In return, the selected relay nodes' energy harvesting requirements will be fulfilled up to a certain threshold through their own payoff so that they have the natural incentive to be selected and involved in the communication. However, relays may exaggerate their private information in order to improve their chance to be selected. Our objective is to develop a mechanism for relay selection that enforces them to reveal the truth since otherwise they may be penalized. We also propose a joint cooperative relay beamforming and transmit power optimization scheme based on an alternating optimization approach. Note that the problem is highly non-convex, since the objective function appears as a product of three correlated Rayleigh quotients. While a common practice in the existing literature is to optimize the relay beamforming vector for given transmit power via rank relaxation, we propose a second-order cone programming-based approach in this paper, which requires a significantly lower computational task. The performance of the incentive control mechanism and the optimization algorithm has bee

Joint Transmit Power and Relay Two-Way Beamforming Optimization for Energy-Harvesting Full-Duplex Communications

This paper studies the joint optimization problem of two-way relay beamforming, the receiver power splitting (PS) ratio as well as the transmit power at the sources to maximize the achievable sum-rate of a simultaneous wireless information and power transfer (SWIPT) system with a full-duplex (FD) multiple-input multiple- output (MIMO) amplify and forward (AF) relay, assuming perfect channel state information (CSI). In particular, our contribution is an iterative algorithm based on the difference of convex programming (DC) and one dimensional searching to achieve the joint solution. Simulation results are provided to demonstrate the effectiveness of the proposed algorithm

A Survey of Scheduling in 5G URLLC and Outlook for Emerging 6G Systems

Future wireless communication is expected to be a paradigm shift from three basic service requirements of 5th Generation (5G) including enhanced Mobile Broadband (eMBB), Ultra Reliable and Low Latency communication (URLLC) and the massive Machine Type Communication (mMTC). Integration of the three heterogeneous services into a single system is a challenging task. The integration includes several design issues including scheduling network resources with various services. Specially, scheduling the URLLC packets with eMBB and mMTC packets need more attention as it is a promising service of 5G and beyond systems. It needs to meet stringent Quality of Service (QoS) requirements and is used in time-critical applications. Thus through understanding of packet scheduling issues in existing system and potential future challenges is necessary. This paper surveys the potential works that addresses the packet scheduling algorithms for 5G and beyond systems in recent years. It provides state of the art review covering three main perspectives such as decentralised, centralised and joint scheduling techniques. The conventional decentralised algorithms are discussed first followed by the centralised algorithms with specific focus on single and multi-connected network perspective. Joint scheduling algorithms are also discussed in details. In order to provide an in-depth understanding of the key scheduling approaches, the performances of some prominent scheduling algorithms are evaluated and analysed. This paper also provides an insight into the potential challenges and future research directions from the scheduling perspective

Robust Energy Harvesting FD Transmission: Interference Suppression Versus Exploitation.

We explore robust designs to jointly minimize the total uplink and downlink transmit power and maximize the total harvested energy in a full duplex system with imperfect channel state information. We first formulate an optimization, where multiuser interference (MUI) is suppressed. We then propose an optimization, where the MUI is rather exploited, both as useful energy and information power, for guaranteeing quality of service and energy harvesting constraints. To tackle the non-convexity of the formulations, we employ convex relaxations. Simulation results show the effectiveness of interference exploitation compared with interference suppression in terms of both power consumption and energy transfer

Interference Exploitation in Full Duplex Communications: Trading Interference Power for Both Uplink and Downlink Power Savings

This paper considers a multiuser full-duplex (FD) wireless communication system, where a FD radio base station (BS) serves multiple single-antenna half-duplex (HD) uplink and downlink users simultaneously. Unlike conventional interference mitigation approaches, we propose to use the knowledge of the data symbols and the channel state information (CSI) at the FD radio BS to exploit the multi-user interference constructively rather than to suppress it. We propose a multi-objective optimization problem (MOOP) via the weighted Tchebycheff method to study the trade-off between the two desirable system design objectives namely the total downlink transmit power and the total uplink transmit power at the same time ensuring the required quality-of-service (QoS) for all users. In the proposed MOOP, we adapt the QoS constraints for the downlink users to accommodate constructive interference (CI) for both generic phase shift keying (PSK) modulated signals as well as for quadrature amplitude modulated (QAM) signals. We also extended our work to a robust design to study the system with imperfect uplink and downlink CSI. Simulation results and analysis show that significant power savings can be obtained. More importantly, however, the MOOP approach here allows for the power saved to be traded off for both uplink and downlink power savings, leading to an overall energy efficiency improvement in the wireless link