شبکه رله با توان بالا بی سیم
Abstract
1. Introduction
2. System model
3. Offline joint TS operation and power allocation algorithm
4. Online joint TS operation and power allocation algorithm
5. Simulation results
6. Conclusions
Declaration of Competing Interest
Acknowledgments
Appendix A. Proof of Proposition 1
Appendix B. Proof of Lemma 1
Appendix C. Proof of Proposition 2
References
Abstract
This paper studies how to maximise the throughput for a wireless-powered relay network where an unreliable direct link exists between a source node and a destination node. Our idea is to optimally combine time allocations (for different relay activities) and power allocations (for the relay to forward different frames) based on a harvest-store-consume (HSC) model. With the HSC model, the network may operate in a direct transmission (DT) mode or a cooperative transmission (CT) mode to transmit one frame. Accordingly, the relay may either harvest energy from the radio-frequency signals in the direct link in DT mode, or harvest energy and forward information in CT mode, where the energy harvested in both modes is stored temporarily before it is consumed for information relaying. Moreover, in our CT mode, the relay distributes the energy to the transmissions of multiple consecutive frames by taking time-varying wireless channel conditions in a time period into account in order to achieve the best throughput performance. We formulate a deterministic optimization problem and a stochastic programming problem under the assumption of full channel state information (CSI) and causal CSI, respectively. Both problems optimally determine DT or CT modes for each frame transmission. In the CT mode, the problems also decide the time-switching (TS) ratios and the transmit power at the relay. Our formulated problems are intractable due to the energy distribution at the relay between multiple frames. This intractability is addressed by dynamic programming techniques which decompose the problems into two tractable subproblems: an outer problem, and an inner problem. By solving the two subproblems, we propose the joint TS operation and power allocation algorithms for the two original formulated problems. The proposed algorithm for causal CSI is an online algorithm with low complexity, while the proposed algorithm for full CSI is offline and provides a benchmark for the online algorithm.
Introduction
Many wireless devices are energy-constrained wireless nodes. In order to extend the lifetime of these communication devices, studies have investigated simultaneous wireless information and power transfer (SWIPT) schemes in various wireless communication scenarios [1–9], allowing wireless devices to harvest energy from radio-frequency (RF) signals when they receive information. More specifically, in a wireless relay network with SWIPT, the relay node with RF energy-harvesting (EH) capability can not only receive information but also harvest energy via the RF signals emitted by the source. By using the harvested energy, the relay can be powered to forward information the destination, extending the lifetime of its batteries. Wireless-powered relaying has been studied for different wireless relay networks in recent years [10–24]. However, most studies have focused on a topology where a direct link between the source and the destination does not exist [10–22]. In practice, a direct link usually exists in a wireless relay network, although such a link may not perform well due to obstacles etc. With the existence of the direct link, when the source sends information to the destination directly, the relay may harvest energy from the RF signals in the direct link. However, it is not a trivial task to make a decision for the relay when to participate in the cooperative transmissions between the source and the destination.