Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies

被引:919
作者
Ozel, Omur [1 ]
Tutuncuoglu, Kaya [2 ]
Yang, Jing [3 ]
Ulukus, Sennur [1 ]
Yener, Aylin [2 ]
机构
[1] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
[2] Penn State Univ, Dept Elect Engn, University Pk, PA 16802 USA
[3] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
Energy harvesting; rechargeable wireless networks; throughput maximization; transmission completion time minimization; directional water-filling; dynamic programming; CONSTRAINTS; NETWORKS;
D O I
10.1109/JSAC.2011.110921
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
080906 [电磁信息功能材料与结构]; 082806 [农业信息与电气工程];
摘要
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the nodes can harvest energy throughout the duration in which communication takes place. As such, transmission policies of the nodes need to adapt to these harvested energy arrivals. In this paper, we consider optimization of point-to-point data transmission with an energy harvesting transmitter which has a limited battery capacity, communicating in a wireless fading channel. We consider two objectives: maximizing the throughput by a deadline, and minimizing the transmission completion time of the communication session. We optimize these objectives by controlling the time sequence of transmit powers subject to energy storage capacity and causality constraints. We, first, study optimal offline policies. We introduce a directional water-filling algorithm which provides a simple and concise interpretation of the necessary optimality conditions. We show the optimality of an adaptive directional water-filling algorithm for the throughput maximization problem. We solve the transmission completion time minimization problem by utilizing its equivalence to its throughput maximization counterpart. Next, we consider online policies. We use stochastic dynamic programming to solve for the optimal online policy that maximizes the average number of bits delivered by a deadline under stochastic fading and energy arrival processes with causal channel state feedback. We also propose near-optimal policies with reduced complexity, and numerically study their performances along with the performances of the offline and online optimal policies under various different configurations.
引用
收藏
页码:1732 / 1743
页数:12
相关论文
共 16 条
[1]
[Anonymous], IEEE T COM UNPUB JUN
[2]
Bertsekas D., 2003, Convex Analysis and Optimization
[3]
Bertsekas D.P., 2007, Dynamic Programming and Optimal Control, V2
[4]
Optimal transmission scheduling over a fading channel with energy and deadline constraints [J].
Fu, A ;
Modiano, E ;
Tsitsiklis, JN .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2006, 5 (03) :630-641
[5]
Optimal energy allocation and admission control for communications satellites [J].
Fu, AC ;
Modiano, E ;
Tsitsiklis, JN .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (03) :488-500
[6]
Control of Wireless Networks with Rechargeable Batteries [J].
Gatzianas, Marios ;
Georgiadis, Leonidas ;
Tassiulas, Leandros .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2010, 9 (02) :581-593
[7]
Capacity of fading channels with channel side information [J].
Goldsmith, AJ ;
Varaiya, PP .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (06) :1986-1992
[8]
Ho C., 2010, IEEE ISIT
[9]
A Generic Model for Optimizing Single-Hop Transmission Policy of Replenishable Sensors [J].
Lei, Jing ;
Yates, Roy ;
Greenstein, Larry .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (02) :547-551
[10]
PRABHAKAR B, 2001, IEEE INFOCOM