Design and optimization for wireless-powered networks

Wireless Power Transfer (WPT) opens an emerging area of Wireless-Powered Networks (WPNs). In narrowband WPNs, beamforming is recognized as a key technique for enhancing information and energy transfer. However, in multi-antenna multi-sine WPT systems, not only the beamforming gain but also the rectifier nonlinearity can be exploited by a waveform design to boost the end-to-end power transfer efficiency. This thesis proposes and optimizes novel transmission strategies for two types of WPNs: narrowband autonomous relay networks and multi-antenna multi-sine WPT systems. The thesis starts by proposing a novel Energy Flow-Assisted (EFA) relaying strategy for a one-way multi-antenna Amplify-and-Forward (AF) autonomous relay network. In contrast to state-of-the-art autonomous relaying strategies, the EFA enables the relay to simultaneously harvest power from source information signals and a dedicated Energy Flow (EF) from the destination for forwarding. As a baseline, a Non-EFA (NEFA) strategy, where the relay splits power from the source signals, is also investigated. We optimize relay strategies for EFA and NEFA, so as to maximize the end-to-end rate and gain insights into the benefit of the EF. To transmit multiple data streams, we extend the EFA and the NEFA to a Multiple-Input Multiple-Output (MIMO) relay network. A novel iterative algorithm is developed to jointly optimize source precoders and relay matrices for the EFA and the NEFA, in order to maximize the end-to-end rate. Based on a channel diagonalization method, we also propose less complex EFA and NEFA algorithms. In the study of waveform designs for multi-antenna multi-sine WPT, large-scale designs with many sinewaves and transmit antennas, computationally tractable algorithms and optimal multiuser waveforms remain open challenges. To tackle these issues, we propose efficient waveform optimization algorithms to maximize the multiuser weighted-sum/minimum rectenna DC output voltage, assuming perfect Channel State Information at the Transmitter (CSIT). An optimization framework is developed to derive these waveform algorithms. Relaxing the assumption on CSIT, we propose waveform strategies for multi-antenna multi-sine WPT based on waveform selection (WS) and waveform refinement (WR), respectively. Applying the strategies, an energy transmitter can generate preferred waveforms for WPT from predesigned codebooks of waveform precoders, according to limited feedback from an energy receiver, which carries information on the harvested energy. Although the WR-based strategy is suboptimal for maximizing the average rectenna output voltage, it causes a lower overhead than the WS-based strategy. We propose novel algorithms to optimize the codebooks for the two strategies.Open Acces

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