Optimal Transmission Policies for Relay Communication Networks With Ambient Energy Harvesting Relays

Ambient energy harvesting has emerged as a promising technique to improve the energy efficiency and reduce the total greenhouse gas emissions for green wireless communications. Energy management for throughput maximization under random energy arrivals has been studied extensively in energy harvestin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE journal on selected areas in communications 2016-12, Vol.34 (12), p.3754-3768
Hauptverfasser: Qian, Li Ping, Feng, Guinian, Leung, Victor C. M.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Ambient energy harvesting has emerged as a promising technique to improve the energy efficiency and reduce the total greenhouse gas emissions for green wireless communications. Energy management for throughput maximization under random energy arrivals has been studied extensively in energy harvesting relay communication networks with either finite-size data buffer or finite-size energy storage. However, the problem is still open when the energy harvesting relay node is subject to both finite-size data and energy storage. In this paper, we study the transmission policy of joint time scheduling and power allocation under a transmission deadline, which maximizes the end-to-end system throughput in a two-hop relay communication network where the energy harvesting relay node is equipped with finite-size data buffer and battery. In particular, we first formulate the throughput maximization problem as a convex optimization problem under an offline optimization framework, and obtain the optimal offline time scheduling and power allocation by the Karush-Kuhn-Tucker conditions based on the full knowledge of energy arrivals and channel states. Then, we formulate the throughput maximization problem as a stochastic dynamic programming problem under the online optimization framework, and obtain the optimal online time scheduling and power allocation by solving a series of convex optimizations based on the casual knowledge of energy arrivals and channel states. Finally, to reduce the computation complexity, we further propose two suboptimal online transmission policies. Numerical results show the impacts of battery capacity and buffer size on the maximum throughput of the proposed policies, as well as the balance between the spectrum efficiency and the delay sensitivity.
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2016.2621356