Abstract

Wireless energy transfer is a promising solution to provide convenient and steady energy supplies for low-power relays. This paper investigates the simultaneous information and energy transfer in fading relay channels, where the relay has no fixed energy supply and replenishes energy from radio frequency signals transmitted by the source. Assume that the relay can switch among energy harvesting, information decoding, and information retransmission in each channel fading state. Our objective is to maximize the ergodic throughput by optimizing the mode switching rule and transmit power jointly under the data and energy causality constraints. When the source knows channel state information (CSI) of all links, to make the problem tractable, for the relay, we neglect the causality constraints during the transmission, and only consider the total data and energy constraints. We thus obtain an upper bound on the ergodic throughput by solving a convex optimization problem. Numerical results show that the achievable rate is very close to the upper bound when we apply the optimized parameters to a practical system. When the source only knows CSI of partial links, the whole transmission process is divided into two phases: the source transmits in the first phase and the relay decodes and forwards received bits using the harvested energy in the second phase. The throughput maximization problem is solved by combing convex optimization, fractional programming, and linear search. We also consider the simplified network topology when a direct link between the source and destination is unavailable. In this network, we propose algorithms based on bisection method to obtain the optimal parameters in information/energy transfer scheduling and power control when the source knows full or partial CSI. The simulation results reveal that the throughput gain brought by wireless powered relaying in different system configurations when the source knows full or partial CSI. Moreover, the effect of the relay position is discussed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.