Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks

This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using OFDMA for both uplink and downlink. The goal is to improve the overall system performance by exploring the full potential of the network in various dimensions including user, subcarrier, relay, and bidirectional traffic. In this work, we first introduce a novel three-time-slot time-division duplexing (TDD) transmission protocol. This protocol unifies direct transmission, one-way relaying and network-coded two-way relaying between the BS and each MS. Using the proposed three-time-slot TDD protocol, we then propose an optimization framework for resource allocation to achieve the following gains: cooperative diversity (via relay selection), network coding gain (via bidirectional transmission mode selection), and multiuser diversity (via subcarrier assignment). We formulate the problem as a combinatorial optimization problem, which is NP-complete. To make it more tractable, we adopt a graph-based approach. We first establish the equivalence between the original problem and a maximum weighted clique problem in graph theory. A metaheuristic algorithm based on any colony optimization (ACO) is then employed to find the solution in polynomial time. Simulation results demonstrate that the proposed protocol together with the ACO algorithm significantly enhances the system total throughput.Comment: 27 pages, 8 figures, 2 table

Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems

Sum-rate maximization in two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying belongs to the class of difference-of-convex functions (DC) programming problems. DC programming problems occur as well in other signal processing applications and are typically solved using different modifications of the branch-and-bound method. This method, however, does not have any polynomial time complexity guarantees. In this paper, we show that a class of DC programming problems, to which the sum-rate maximization in two-way MIMO relaying belongs, can be solved very efficiently in polynomial time, and develop two algorithms. The objective function of the problem is represented as a product of quadratic ratios and parameterized so that its convex part (versus the concave part) contains only one (or two) optimization variables. One of the algorithms is called POlynomial-Time DC (POTDC) and is based on semi-definite programming (SDP) relaxation, linearization, and an iterative search over a single parameter. The other algorithm is called RAte-maximization via Generalized EigenvectorS (RAGES) and is based on the generalized eigenvectors method and an iterative search over two (or one, in its approximate version) optimization variables. We also derive an upper-bound for the optimal values of the corresponding optimization problem and show by simulations that this upper-bound can be achieved by both algorithms. The proposed methods for maximizing the sum-rate in the two-way AF MIMO relaying system are shown to be superior to other state-of-the-art algorithms.Comment: 35 pages, 10 figures, Submitted to the IEEE Trans. Signal Processing in Nov. 201

Energy harvesting based two-way full-duplex relaying network over a Rician fading environment: performance analysis

Full-duplex transmission is a promising technique to enhance the capacity of communication systems. In this paper, we propose and investigate the system performance of an energy harvesting based two-way full-duplex relaying network over a Rician fading environment. Firstly, we analyse and demonstrate the analytical expressions of the achievable throughput, outage probability, optimal time switching factor, and symbol error ratio of the proposed system. In the second step, the effect of various parameters of the system on its performance is presented and investigated. In the final step, the analytical results are also demonstrated by Monte Carlo simulation. The numerical results proved that the analytical results and the simulation results agreed with each other.Web of Science68112311

Joint Wireless Information and Power Transfer for an Autonomous Multiple Antenna Relay System

Considering a three-node multiple antenna relay system, this paper proposes a two-phase amplify-and-forward (AF) relaying protocol, which enables the autonomous relay to simultaneously harvest wireless power from the source information signal and from an energy signal conveyed by the destination. We first study this energy-flow-assisted (EFA) relaying in a single-input single-output (SISO) relay system and aim at maximizing the rate. By transforming the optimization problem into an equivalent convex form, a global optimum can be found. We then extend the protocol to a multiple antenna relay system. The relay processing matrix is optimized to maximize the rate. The optimization problem can be efficiently solved by eigenvalue decomposition, after linear algebra manipulation. It is observed that the benefits of the energy flow are interestingly shown only in the multiple antenna case, and it is revealed that the received information signal and the energy leakage at the relay can be nearly separated by making use of the signal space, such that the desired signal can be amplified with a larger coefficient.Comment: Accepted to IEEE Communications Letter