Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThroughput Maximization in Two-hop DF Multiple-Relay Network with Simultaneous Wireless Information and Power Transfer
52
0
0.0
(
0
)
Added by
Rongfei Fan
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
This paper investigates the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at every relay node is taken into account and two models for approximating the nonlinearity are adopted: logistic model and linear cut-off model. Decode-and-forward (DF) is implemented, and time switching (TS) mode and power splitting (PS) mode are considered. Optimization problems are formulated for TS mode and PS mode under logistic model and linear cut-off model, respectively. End-to-end throughput is aimed to be maximized by optimizing the transmit power and bandwidth on every source-relay-destination link, and PS ratio and/or TS ratio on every relay node. Although the formulated optimization problems are all non-convex. Through a series of analysis and transformation, and with the aid of bi-level optimization and monotonic optimization, etc., we find the global optimal solution of every formulated optimization problem. In some case, a simple yet optimal solution of the formulated problem is also derived. Numerical results verify the effectiveness of our proposed methods.
rate research
Read More
This paper investigates power splitting for full-duplex relay networks with wireless information and energy transfer. By applying power splitting as a relay transceiver architecture, the full duplex information relaying can be powered by energy harvested from the source-emitted radio frequency signal. In order to minimize outage probability, power splitting ratios have been dynamically optimized according to full channel state information (CSI) and partial CSI, respectively. Under strong loop interference, the proposed full CSI-based and partial CSI-based power splitting schemes achieve the better outage performance than the fixed power splitting scheme, whereas the partial CSI-based power splitting scheme can ensure competitive outage performance without requiring CSI of the second-hop link. It is also observed that the worst outage performance is achieved when the relay is located midway between the source and destination, whereas the outage performance of partial CSI-based power splitting scheme approaches that of full CSI-based scheme when the relay is placed close to the destination.
Powering mobiles using microwave emph{power transfer} (PT) avoids the inconvenience of battery recharging by cables and ensures uninterrupted mobile operation. The integration of PT and emph{information transfer} (IT) allows wireless PT to be realized by building on the existing infrastructure for IT and also leads to compact mobile designs. As a result, emph{simultaneous wireless information and power transfer} (SWIPT) has emerged to be an active research topic that is also the theme of this paper. In this paper, a practical SWIPT system is considered where two multi-antenna stations perform separate PT and IT to a multi-antenna mobile to accommodate their difference in ranges. The mobile dynamically assigns each antenna for either PT or IT. The antenna partitioning results in a tradeoff between the MIMO IT channel capacity and the PT efficiency. The optimal partitioning for maximizing the IT rate under a PT constraint is a NP-hard integer program, and the paper proposes solving it via efficient greedy algorithms with guaranteed performance. To this end, the antenna-partitioning problem is proved to be one that optimizes a sub-modular function over a matroid constraint. This structure allows the application of two well-known greedy algorithms that yield solutions no smaller than the optimal one scaled by factors $(1-1/e)$ and 1/2, respectively.
Simultaneous wireless information and power transfer (SWIPT) is an appealing research area because both information and energy can be delivered to wireless devices simultaneously. In this paper, we propose a diplexer-based receiver architecture that can utilizes both the doubling frequency and baseband signals after the mixer. The baseband signals are used for information decoding and the doubling frequency signals are converted to direct current for energy harvesting. We analyze the signal in the receiver and find that the power of the energy harvested is equal to that of information decoded. Therefore, the diplexer can be used as a power splitter with a power splitting factor of 0.5. Specifically, we consider a multiuser multi-input single-output (MISO) system, in which each user is equipped with the newly proposed receiver. The problem is formulated as an optimization problem that minimizes the total transmitted power subject to some constraints on each users quality of service and energy harvesting demand. We show that the problem thus formulated is a non-convex quadratically constrained quadratic program (QCQP), which can be solved by semi-definite relaxation.
This study investigates wireless information and energy transfer for dual-hop amplify-and-forward full-duplex relaying systems. By forming energy efficiency (EE) maximization problem into a concave fractional program of transmission power, three relay control schemes are separately designed to enable energy harvesting and full-duplex information relaying. With Rician fading modeled residual self-interference channel, analytical expressions of outage probability and ergodic capacity are presented for the maximum relay, signal-to-interference-plus-noise-ratio (SINR) relay, and target relay. It has shown that EE maximization problem of the maximum relay is concave for time switching factor, so that bisection method has been applied to obtain the optimized value. By incorporating instantaneous channel information, the SINR relay with collateral time switching factor achieves an improved EE over the maximum relay in delay-limited and delay-tolerant transmissions. Without requiring channel information for the second-hop, the target relay ensures a competitive performance for outage probability, ergodic capacity, and EE. Comparing to the direct source-destination transmission, numerical results show that the proposed relaying scheme is beneficial in achieving a comparable EE for low-rate delay-limited transmission.
This paper studies low-latency streaming codes for the multi-hop network. The source is transmitting a sequence of messages (streaming messages) to a destination through a chain of relays where each hop is subject to packet erasures. Every source message has to be recovered perfectly at the destination within a delay constraint of $T$ time slots. In any sliding window of $T+1$ time slots, we assume no more than $N_j$ erasures introduced by the $j$th hop channel. The capacity in case of a single relay (a three-node network) was derived by Fong [1], et al. While the converse derived for the three-node case can be extended to any number of nodes using a similar technique (analyzing the case where erasures on other links are consecutive), we demonstrate next that the achievable scheme, which suggested a clever symbol-wise decode and forward strategy, can not be straightforwardly extended without a loss in performance. The coding scheme for the three-node network, which was shown to achieve the upper bound, was ``state-independent (i.e., it does not depend on specific erasure pattern). While this is a very desirable property, in this paper, we suggest a ``state-dependent (i.e., a scheme which depends on specific erasure pattern) and show that it achieves the upper bound up to the size of an additional header. Since, as we show, the size of the header does not depend on the field size, the gap between the achievable rate and the upper bound decreases as the field size increases.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
