# Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies^{†}^{†}thanks: Omur Ozel and Sennur Ulukus are with the Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA. Kaya Tutuncuoglu and Aylin Yener are with the Department of Electrical Engineering, Pennsylvania State University, University Park, PA 16802, USA. Jing Yang was with the Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA. She is now with the Department of Electrical and Computer Engineering, University of Wisconsin-Madison, WI 53706, USA. This work was supported by NSF Grants CNS 09-64632, CNS 09-64364 and presented in part at the Conference on Information Sciences and Systems (CISS), Baltimore, MD, March 2011 and at IEEE International Conference on Computer Communications (INFOCOM), Shangai, China, April 2011.

###### Abstract

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.

1.6

Energy harvesting, rechargeable wireless networks, throughput maximization, transmission completion time minimization, directional water-filling, dynamic programming.

## I Introduction

This paper considers wireless communication using energy harvesting transmitters. In such a scenario, incremental energy is harvested by the transmitter during the course of data transmission from random energy sources. As such, energy becomes available for packet transmission at random times and in random amounts. In addition, the wireless communication channel fluctuates randomly due to fading. These together lead to a need for designing new transmission strategies that can best take advantage of and adapt to the random energy arrivals as well as channel variations in time.

The simplest system model for which this setting leads to new design insights is a wireless link with a rechargeable transmitter, which we consider here. The incoming energy can be stored in the battery of the rechargeable transmitter for future use. However, this battery has finite storage capacity and the transmission policy needs to guarantee that there is sufficient battery space for each energy arrival, otherwise incoming energy cannot be saved and will be wasted. In this setting, we find optimal offline and online transmission schemes that adapt the instantaneous transmit power to the variations in the energy and fade levels.

There has been recent research effort on understanding data transmission with an energy harvesting transmitter that has a rechargeable battery [1, 2, 3, 4, 5, 6, 7]. In [1], data transmission with energy harvesting sensors is considered, and the optimal online policy for controlling admissions into the data buffer is derived using a dynamic programming framework. In [2], energy management policies which stabilize the data queue are proposed for single-user communication and under a linear approximation, some delay optimality properties are derived. In [3], the optimality of a variant of the back pressure algorithm using energy queues is shown. In [4], throughput optimal energy allocation is studied for energy harvesting systems in a time constrained slotted setting. In [5, 6], minimization of the transmission completion time is considered in an energy harvesting system and the optimal solution is obtained using a geometric framework similar to the calculus approach presented in [8]. In [7], energy harvesting transmitters with batteries of finite energy storage capacity are considered and the problem of throughput maximization by a deadline is solved in a static channel.

An earlier line of research considered the problem of energy management in communications satellites [9, 10]. In [9], various energy allocation problems in solar powered communication satellites are solved using dynamic programming. In [10], optimal energy allocation to a fixed number of time slots is derived under time-varying channel gains and with offline and online knowledge of the channel state at the transmitter. Another related line of research considered energy minimal transmission problems with deadline constraints [11, 12, 8, 13]. Our work provides optimal transmission policies to maximize the throughput and minimize the transmission completion time, under channel fluctuations and energy variations, in a continuous time model, generalizing these related works, [4, 10, 5, 6, 7, 11, 12, 8, 13], from various different perspectives.

In particular, we consider two related optimization problems. The first problem is the maximization of the number of bits (or throughput) transmitted by a deadline . The second problem is the minimization of the time (or delay) by which the transmission of bits is completed. We solve the first problem under deterministic (offline) and stochastic (online) settings, and we solve the second problem in the deterministic setting. We start the analysis by considering the first problem in a static channel under offline knowledge. The solution calls for a new algorithm, termed directional water-filling. Taking into account the causality constraints on the energy usage, i.e., the energy can be saved and used in the future, the algorithm allows energy flow only to the right. In the algorithmic implementation of the solution, we utilize right permeable taps at each energy arrival point. This solution serves as a building block for the fading case. Specifically, we show that a directional water-filling algorithm that adapts to both energy arrivals and channel fade levels is optimal. Next, we consider the second problem, i.e., the minimization of the time by which transmission of bits is completed. We use the solution of the first problem to solve this second problem. This is accomplished by mapping the first problem to the second problem by means of the maximum departure curve. This completes the identification of the optimal offline policies in the fading channel.

Next, we set out to find online policies. We address online scheduling for maximum throughput by the deadline in a setting where fading level changes and energy arrives as random processes in time. Assuming statistical knowledge and causal information of the energy and fading variations, we solve for the optimal online power policy by using continuous time stochastic dynamic programming [13, 14]. To reduce the complexity required by the dynamic programming solution, we propose simple online algorithms that perform near-optimal. Finally, we provide a thorough numerical study of the proposed algorithms under various system settings.

## Ii System Model

We consider a single-user fading channel with additive Gaussian noise and causal channel state information (CSI) feedback as shown in Fig. 1. The transmitter has two queues, the data queue where data packets are stored, and an energy queue where the arriving (harvested) energy is stored. The energy queue, i.e., the battery, can store at most units of energy, which is used only for transmission, i.e., energy required for processing is not considered.

The received signal is given by , where is the (squared) fading, is the channel input, and is a Gaussian random noise with zero-mean and unit-variance. Whenever an input signal is transmitted with power in an epoch of duration , bits of data is served out from the backlog with the cost of units of energy depletion from the energy queue. This follows from the Gaussian channel capacity formula. The bandwidth is sufficiently wide so that can take small values and we approximate the slotted system to a continuous time system. Hence, we say that if at time the transmit power of the signal is , the instantaneous rate in bits per channel use is

(1) |

Following a model similar to [12], we assume that the fading level and energy arrivals are stochastic processes in time that are marked by Poisson counting processes with rates and , respectively. Therefore, changes in fading level and energy arrivals occur in countable time instants, which are indexed respectively as and with the convention that . By the Poisson property, the inter-occurrence times and are exponentially distributed with means and , respectively. The fading level in is , in is , and so on. Similarly, units of energy arrives at time , and units of energy is available at time . Hence and completely define the events that take place during the course of data transmission. This model is shown in Fig. 2. The incoming energy is first buffered in the battery before it is used in data transmission, and the transmitter is allowed to use the battery energy only. Accordingly, we assume for all as otherwise excess energy cannot be accommodated in the battery anyway.

In the sequel, we will refer to a change in the channel fading level or in the energy level as an event and the time interval between two consecutive events as an epoch. More precisely, epoch is defined as the time interval where and are the times at which successive events happen and the length of the epoch is . Naturally, energy arrival information is causally available to the transmitter. Moreover, by virtue of the causal feedback link, perfect information of the channel fade level is available to the transmitter. Therefore, at time all and such that and are known perfectly by the transmitter.

A power management policy is denoted as for . There are two constraints on , due to energy arrivals at random times and also due to finite battery storage capacity. Since energy that has not arrived yet cannot be used at the current time, there is a causality constraint on the power management policy as:

(2) |

where the limit of the integral should be interpreted as , for small enough . Moreover, due to the finite battery storage capacity, we need to make sure that energy level in the battery never exceeds . Since energy arrives at certain time points, it is sufficient to ensure that the energy level in the battery never exceeds at the times of energy arrivals. Let . Then,

(3) |

We emphasize that our system model is continuous rather than slotted. In slotted models, e.g., [9, 3, 4], the energy input-output relationship is written for an entire slot. Such models allow energies larger than to enter the battery and be used for transmission in a given single slot. Our continuous system model prohibits such occurrences.

Our ultimate goal is to develop an online algorithm that determines the transmit power as a function of time using the causal knowledge of the system, e.g., the instantaneous energy state and fading CSI. We will start our development by considering the optimal offline policy.

## Iii Maximizing Throughput in a Static Channel

In this section, we consider maximizing the number of bits delivered by a deadline , in a non-fading channel with offline knowledge of energy arrivals which occur at times in amounts . The epoch lengths are for with , and . There are a total of epochs. The optimization is subject to causality constraints on the harvested energy, and the finite storage constraint on the rechargeable battery. This problem was solved in [7] using a geometric framework. Here, we provide the formulation for completeness and provide an alternative algorithmic solution which will serve as the building block for the solution for the fading channel presented in the next section.

First, we note that the transmit power must be kept constant in each epoch [5, 6, 7], due to the concavity of rate in power. Let us denote the power in epoch by . The causality constraints in (2) reduce to the following constraints on ,

(4) |

Moreover, since the energy level in the battery is the highest at instants when energy arrives, the battery capacity constraints in (3) reduce to a countable number of constraints, as follows

(5) |

Note that since , there is no incentive to make for any . Hence, is necessary for optimality.

The optimization problem is:

(6) | |||||

s.t. | (8) | ||||

We note that the constraint in (8) must be satisfied with equality for , otherwise, we can always increase some without conflicting any other constraints, increasing the resulting number of bits transmitted.

Note that the objective function in (6) is concave in the vector of powers since it is a sum of functions, which are concave themselves. In addition, the constraint set is convex as it is composed of linear constraints. Hence, the above optimization problem is a convex optimization problem, and has a unique maximizer. We define the following Lagrangian function [15] for any and ,

(9) |

Lagrange multipliers are associated with constraints in (8) and are associated with (8). Additional complimentary slackness conditions are as follows,

(10) | ||||

(11) |

In (10), is not included since this constraint is in fact satisfied with equality, because otherwise the objective function can be increased by increasing some . Note also that as , we did not include any slackness conditions for .

We apply the KKT optimality conditions to this Lagrangian to obtain the optimal power levels in terms of the Lagrange multipliers as,

(12) |

and . Note that that satisfy is unique.

Based on the expression for in terms of the Lagrange multipliers in (12), we have the following observation on the structure of the optimal power allocation scheme.

###### Theorem 1

When , the optimal power levels is a monotonically increasing sequence: . Moreover, if for some , , then .

Proof: Since , constraints in (8) are satisfied without equality and for all by slackness conditions in (11). From (12), since , optimum are monotonically increasing: . Moreover, if for some , , then , which means .

The monotonicity in Theorem 1 is a result of the fact that energy may be spread from the current time to the future for optimal operation. Whenever a constraint in (8) is not satisfied with equality, it means that some energy is available for use but is not used in the current epoch and is transferred to future epochs. Hence, the optimal power allocation is such that, if some energy is transferred to future epochs, then the power level must remain the same. However, if the optimal power level changes from epoch to , then this change should be in the form of an increase and no energy is transferred for future use. That is, the corresponding constraint in (8) is satisfied with equality.

If is finite, then its effect on the optimal power allocation is observed through in (12). In particular, if the constraints in (8) are satisfied without equality, then optimal are still monotonically increasing since . However, as for all , the constraint with the same index in (8) is satisfied without equality whenever a constraint in (8) is satisfied with equality. Therefore, a non-zero and a zero appear in in (12). This implies that the monotonicity of may no longer hold. constraint restricts power levels to take the same value in adjacent epochs as it constrains the energy that can be transferred from current epoch to the future epochs. Indeed, from constraints in (8), the energy that can be transferred from current, say the th, or previous epochs, to future epochs is . Hence, the power levels are equalized only to the extent that constraint allows.

### Iii-a Directional Water-Filling Algorithm

We interpret the observed properties of the optimal power allocation scheme as a directional water-filling scheme. We note that if units of water (energy) is filled into a rectangle of bottom size , then the water level is . Another key ingredient of the directional water-filling algorithm is the concept of a right permeable tap, which permits transfer of water (energy) only from left to right.

Consider the two epoch system. Assume is sufficiently large. If , then some energy is transferred from epoch to epoch so that the levels are equalized. This is shown in the top figure in Fig. 3. However, if , no energy can flow from right to left. This is due to the causality of energy usage, i.e., energy cannot be used before it is harvested. Therefore, as shown in the middle figure in Fig. 3, the water levels are not equalized. We implement this using right permeable taps, which let water (energy) flow only from left to right.

We note that the finite case can be incorporated into the energy-water analogy as a constraint on the amount of energy that can be transferred from the past to the future. If the equalizing water level requires more than amount of energy to be transferred, then only can be transferred. Because, otherwise, the energy level in the next epoch exceeds causing overflow of energy, which results in inefficiencies. More specifically, when the right permeable tap in between the two epochs of the example in bottom figure in Fig. 3 is turned on, only amount of energy transfer is allowed from epoch to epoch .

## Iv Maximizing Throughput in a Fading Channel

We now solve for the offline policy for the fading channel utilizing the insights obtained in the previous section. The channel state changes times and energy arrives times in the duration . Hence, we have epochs. Our goal is again to maximize the number of bits transmitted by the deadline . Similar to the non-fading case, the optimal power management strategy is such that the transmit power is constant in each event epoch. Therefore, let us again denote the transmit power in epoch by , for . We define as the energy which arrives in epoch . Hence, for some if event is an energy arrival and if event is a fade level change. Also, . Similar to the non-fading case, we have causality constraints due to energy arrivals and an constraint due to finite battery size. Hence, the optimization problem in this fading case becomes:

(13) | |||||

s.t. | (15) | ||||

Note that, as in the non-fading case, the constraint in (15) for must be satisfied with equality, since otherwise, we can always increase one of to increase the throughput.

As in the non-fading case, the objective function in (13) is concave and the constraints are convex. The optimization problem has a unique optimal solution. We define the Lagrangian for any , and as,

(16) |

Note that we have not employed the Lagrange multipliers in the non-fading case, since in that case, we need to have all . However, in the fading case, some of the optimal powers can be zero depending on the channel fading state. Associated complimentary slackness conditions are,

(17) | ||||

(18) | ||||

(19) |

It follows that the optimal powers are given by

(20) |

where the water level in epoch , , is

(21) |

We have the following observation for the fading case.

###### Theorem 2

When , for any epoch , the optimum water level is monotonically increasing: . Moreover, if some energy is transferred from epoch to , then .

Proof: assumption results in for all . From (21), and since , we have . If energy is transferred from the th epoch to the st epoch, then the th constraint in (15) is satisfied without equality. This implies, by slackness conditions in (17), that for those , we have . Hence, by (21), . In particular, for all epochs and that are in between two consecutive energy arrivals as there is no wall between these epochs and injected energy freely spreads into these epochs.

As in the non-fading case, the effect of finite is observed via the Lagrange multipliers . In particular, whenever constraint is satisfied with equality, the monotonicity of the water level no longer holds. constrains the amount of energy that can be transferred from one epoch to the next. Specifically, the transferred energy cannot be larger than . Note that this constraint is trivially satisfied for those epochs with because and hence the water level in between two energy arrivals must be equalized. However, the next water level may be higher or lower depending on the new arriving energy amount.

### Iv-a Directional Water-Filling Algorithm

The directional water-filling algorithm in the fading channel requires walls at the points of energy arrival, with right permeable water taps in each wall which allows at most amount of water to flow. No walls are required to separate the epochs due to changes in the fading level. The water levels when each right permeable tap is turned on will be found by the directional water-filling algorithm. Optimal power allocation is then calculated by plugging the resulting water levels into (20). An example run of the algorithm is shown in Fig. 4, for a case of 12 epochs. Three energy arrivals occur during the course of the transmission, in addition to the energy available at time . We observe that the energy level equalizes in epochs 2, 4, 5, while no power is transmitted in epochs 1 and 3, since the channel gains in these epochs are too low (i.e., too high). The energy arriving at the beginning of epoch 6 cannot flow left due to causality constraints, which are enforced by right permeable taps, which allow energy flow only to the right. We observe that the energy equalizes between epochs 8 through 12, however, the excess energy in epochs 6 and 7 cannot flow right, due to the constraint enforced by the right permeable tap between epochs 7 and 8.

## V Transmission Completion Time Minimization in Fading Channel

In contrast to the infinite backlog assumption of the previous sections, we now assume that the transmitter has bits to be communicated to the receiver in the energy harvesting and fading channel setting. Our objective now is to minimize the time necessary to transmit these bits. This problem is called the transmission completion time minimization problem. In [5, 6], this problem is formulated and solved for an energy harvesting system in a non-fading environment. In [7], the problem is solved when there is an constraint on the energy buffer (battery) by identifying its connection to its throughput optimization counterpart. Here, our goal is to address this problem in a fading channel, by using the directional water-filling approach we have developed so far.

The transmission completion time minimization problem can be stated as,

(22) | |||||

s.t. | (25) | ||||

where is the number of epochs in the interval . The solution will be a generalization of the results in [5, 6, 7] for the fading case. To this end, we introduce the maximum departure curve. This maximum departure curve function will map the transmission completion time minimization problem of this section to the throughput maximization problem of the previous sections.

### V-a Maximum Departure Curve

Given a deadline , define the maximum departure curve for a given sequence of energy arrivals and channel fading states as,

(26) |

where is the number of epochs in the interval . The maximization in (26) is subject to the energy causality and maximum battery storage capacity constraints in (25) and (25). The maximum departure function represents the maximum number of bits that can be served out of the backlog by the deadline given the energy arrival and fading sequences. This is exactly the solution of the problem studied in the previous sections. Some characteristics of the maximum departure curve are stated in the following lemma.

###### Lemma 1

The maximum departure curve is a monotonically increasing and continuous function of . is not differentiable at and .

Proof: The monotonicity follows because as the deadline is increased, we can transmit at least as many bits as we could with the smaller deadline. The continuity follows by observing that, if no new energy arrives or fading state changes, there is no reason to have a discontinuity. When new energy arrives, since the number of bits that can be transmitted with a finite amount of energy is finite, the number of bits transmitted will not have any jumps. Similarly, if the fading level changes, due to the continuity of the function, will be continuous.

For the non-differentiable points, assume that at , an energy in the amount of arrives. There exists a small enough increment from that the water level on the right is higher than the water level on the left. The right permeable taps will not allow this water to flow to left. Then, the will have the following form:

(27) |

Thus, the right derivative of at , becomes arbitrarily large. Hence, is not differentiable at . At , the fade level changes from to . As is increased, water level decreases unless new energy arrives. The change in the water level is proportional to for and is proportional to for . Hence, at , is not differentiable.

The continuity and monotonicity of implies that the inverse function of exists, and that for a closed interval , is also a closed interval. Since is obtained by the directional water-filling algorithm, the derivative of has the interpretation of the rate of energy transfer from past into the future at time , i.e., it is the measure of the tendency of water to flow right. The non-differentiabilities at energy arrival and fading change points are compatible with this interpretation.

We can visualize the result of Lemma 1 by considering a few simple examples. As the simplest example, consider the non-fading channel () with units of energy available at the transmitter (i.e., no energy arrivals). Then, the optimal transmission scheme is a constant transmit power scheme, and hence, we have,

(28) |

It is clear that this is a continuous, monotonically increasing function, whose derivative at (at the time of energy arrival) is unbounded.

Next, we consider a two epoch case where arrives at and fading level is constant (and also ). We assume and are both smaller than and . After some algebra, can shown to be expressed as,

(29) |

where , . In this constrained case, the asymptote of as is strictly smaller than that in case.

In the most general case where we have multiple energy arrivals and channel state changes, these basic properties will follow. An example case is shown in Fig. 5. Note that there may be discontinuities in due to other reasons than fading level changes and energy arrivals, such as the constraint.

### V-B Solution of the Transmission Completion Time Minimization Problem in a Fading Channel

We now solve the transmission completion time minimization problem stated in (22)-(25). Minimization of the time to complete the transmission of bits available at the transmitter is closely related with the maximization of the number of bits that can be sent by a deadline. In fact, if the maximum number of bits that can be sent by is less than , then it is not possible to complete the transmission of bits by . As we state formally below, if is the minimal time to complete the transmission of bits, then necessarily . This argument provides a characterization for in terms of the maximum departure curve, as stated in the following theorem.

###### Theorem 3

The minimum transmission completion time to transmit bits is where .

Proof: For such that , since the maximum number of bits that can be served by is and it is less than . Hence, bits cannot be completed by . Conversely, for such that , because bits can be completed by . Hence, is a necessary condition. As is continuous, the set is a closed set. Hence, exists and is unique. By the definition of , we have .

## Vi Online Transmission Policies

In this section, we will study scheduling in the given setting with online, i.e., causal, information of the events. In particular, we consider the maximization of the number of bits sent by deadline given only causal information of the energy arrivals and channel fade levels at the transmitter side as in Fig. 1.

We assume that the energy arrival is a compound Poisson process with a density function . Hence, is a Poisson random variable with mean . The channel fade level is a stochastic process marked with a Poisson process of rate . Thus, is Poisson with mean . The channel takes independent values with probability density at each marked time and remains constant in between two marked points.

### Vi-a Optimal Online Policy

The states of the system are fade level and battery energy . An online policy is denoted as which denotes the transmit power decided by the transmitter at time given the states and . We call a policy admissible if is nonnegative, for all and and . That is, we impose an infinite cost if the remaining energy in the battery is non-zero after the deadline. Hence, admissible policies guarantee that no transmission can occur if the battery energy is zero and energy left in the battery at the time of the deadline is zero so that resources are used fully by the deadline. The throughput is the expected number of bits sent by the time under the policy

(30) |

Then, the value function is the supremum over all admissible policies

(31) |

Therefore, the optimal online policy is such that , i.e., it solves the following problem

(32) |

In order to solve (32), we first consider -skeleton of the random processes [13]. For sufficiently small , we quantize the time by and have the following.

(33) |

Then, we can recursively solve (33) to obtain for . This procedure is the dynamic programming solution for continuous time and the outcome is the optimal online policy [13, 14]. After solving for , the transmitter records this function as a look-up table and at each time , it receives feedback , senses the battery energy and transmits with power .

### Vi-B Other Online Policies

Due to the curse of dimensionality inherent in the dynamic programming solution, it is natural to forgo performance in lieu of less complex online policies. In this subsection, we propose several suboptimal transmission policies that can somewhat mimic the offline optimal algorithms while being computationally simpler and requiring less statistical knowledge. In particular, we resort to event-based online policies which react to a change in fading level or an energy arrival. Whenever an event is detected, the online policy decides on a new power level. Note that the transmission is subject to availability of energy and the constraint.

#### Vi-B1 Constant Water Level Policy

The constant water level policy makes online decisions for the transmit power whenever a change in fading level is observed through the causal feedback. Assuming that the knowledge of the average recharge rate is available to the transmitter and that fading density is known, the policy calculates that solves the following equation.

(34) |

Whenever a change in the fading level occurs, the policy decides on the following power level . If the energy in the battery is nonzero, transmission with is allowed, otherwise the transmitter becomes silent.

Note that this power control policy is the same as the capacity achieving power control policy in a stationary fading channel [16] with an average power constraint equal to the average recharge rate. In [2], this policy is proved to be stability optimal in the sense that all data queues with stabilizable arrival rates can be stabilized by policies in this form where the power budget is for some sufficiently small. However, for the time constrained setting, this policy is strictly suboptimal as will be verified in the numerical results section. This policy requires the transmitter to know the mean value of the energy arrival process and the full statistics of the channel fading. A channel state information (CSI) feedback is required from the receiver to the transmitter at the times of events only.

#### Vi-B2 Energy Adaptive Water-Filling

Another reduced complexity event-based policy is obtained by adapting the water level to the energy level in each event. Again the fading statistics is assumed to be known. Whenever an event occurs, the policy determines a new power level. In particular, the cutoff fade level is calculated at each energy arrival time as the solution of the following equation

(35) |

where is the energy level at the time of the event. Then, the transmission power level is determined similarly as . This policy requires transmitter to know the fading statistics. A CSI feedback is required from the receiver to the transmitter at the times of changes in the channel state.

#### Vi-B3 Time-Energy Adaptive Water-Filling

A variant of the energy adaptive water filling policy is obtained by adapting the power to the energy level and the remaining time to the deadline. The cutoff fade level is calculated at each energy arrival time as the solution of the following equation.

(36) |

Then, the transmission power level is determined as .

## Vii Numerical Results

We consider a fading additive Gaussian channel with bandwidth where the instantaneous rate is

(37) |

is the channel SNR, i.e., the actual channel gain divided by the noise power spectral density multiplied by the bandwidth, and is the transmit power at time . Bandwidth is chosen as MHz for the simulations.

We will examine the deadline constrained throughput performances of the optimal offline policy, optimal online policy, and other proposed sub-optimal online policies. In particular, we compare the optimal performance with the proposed sub-optimal online policies which are based on waterfilling [16]. The proposed sub-optimal online policies use the fading distribution, and react only to the new energy arrivals and fading level changes. These event-based algorithms require less feedback and less computation, however, the fact that they react only to the changes in the fading level and new energy arrivals is a shortcoming of these policies. Since the system is deadline constrained, the policies need to take the remaining time into account yet the proposed policies do not do this optimally. We will simulate these policies under various different settings and we will observe that the proposed sub-optimal policies may perform very well in some cases while not as well in some others.

We perform all simulations for 1000 randomly generated realizations of the channel fade pattern and is taken for the calculation of the optimal online policy. The rates of Poisson mark processes for energy arrival and channel fading and are assumed to be 1. The unit of is and that of is . Hence, the mean value of the density function is also the average recharge rate and the mean value of is the average fading level. The changes in the fading level occur relatively slowly with respect to the symbol duration.

is set as a non-negative uniform random variable with mean , and as the energy arrival is assumed to be smaller than , we have . Selection of the constraint is just for illustration. In real life, sensors may have batteries of on the order of kJ but the battery feeds all circuits in the system. Here, we assume a fictitious battery that carries energy for only communication purposes. Hence, on the order of J will be considered. We will examine different fading distributions . In particular, Nakagami distribution with different shape parameter will be considered. We implement the specified fading by sampling its probability density function with sufficiently large number of points.

In order to assess the performance, we find an upper bound on the performances of the policies by first assuming that the channel fading levels and energy arrivals in the interval are known non-causally, and that the total energy that will arrive in is available at the transmitter at time . Then, for the water level that is obtained by spreading the total energy to the interval , with the corresponding fading levels, yield the throughput defined in the following

(38) |

as an upper bound for the average throughput in the interval; here denotes the duration of the fade level in the th epoch. Even the offline optimal policy has a smaller average throughput than as the causality constraint does not allow energies to be spread evenly into the entire interval.

We start with examining the average throughput of the system under Rayleigh fading with SNR dB and deadline sec, J as depicted in Fig. 6. We observe that time-energy adaptive waterfilling policy performs quite close to the optimal online policy in the low recharge rate regime. It can be a viable policy to spread the incoming energy when the recharge rate is low; however, its performance saturates as the recharge rate is increased. In this case the incoming energy cannot be easily accommodated and more and more energy is lost due to overflows. Similar trends can be found in Fig. 7 under very low recharge rate regime in the same setting with only difference being the battery capacity J. Next, we examine the setting with sec, J under Nakagami fading of (average SNR dB) and we observe similar performances as in the previous cases. As a common behavior in these settings, energy adaptive water-filling performs poorer with respect to the constant water level and time-energy adaptive water-filling schemes.

Finally, we examine the policies under different deadline constraints and present the plots for Nakagami fading distribution with in Fig. 9. A remarkable result is that as the deadline is increased, stability optimal [2] constant water level policy approaches the optimal online policy. We conclude that the time-awareness of the optimal online policy has less and less importance as the deadline constraint becomes looser. We also observe that the throughput of the energy-adaptive waterfilling policy is roughly a constant regardless of the deadline. Moreover, the time-energy adaptive policy performs worse as is increased because energies are spread to very long intervals rendering the transmit power very small and hence energy accumulates in the battery. This leads to significant energy overflows since the battery capacity is limited, and the performance degrades.

## Viii Conclusions

We developed optimal energy management schemes for energy harvesting systems operating in fading channels, with finite capacity rechargeable batteries. We considered two related problems under offline knowledge of the events: maximizing the number of bits sent by a deadline, and minimizing the time it takes to send a given amount of data. We solved the first problem using a directional water-filling approach. We solved the second problem by mapping it to the first problem via the maximum departure curve function. Finally, we solved for throughput optimal policy for the deadline constrained setting under online knowledge of the events using dynamic programming in continuous time. Our numerical results show the performances of these algorithms under offline and online knowledge.

## References

- [1] J. Lei, R. Yates, and L. Greenstein, “A generic model for optimizing single-hop transmission policy of replenishable sensors,” IEEE Trans. Wireless Commun., vol. 8, pp. 547–551, February 2009.
- [2] V. Sharma, U. Mukherji, V. Joseph, and S. Gupta, “Optimal energy management policies for energy harvesting sensor nodes,” IEEE Trans. Wireless Commun., vol. 9, pp. 1326–1336, April 2010.
- [3] M. Gatzianas, L. Georgiadis, and L. Tassiulas, “Control of wireless networks with rechargeable batteries,” IEEE Trans. Wireless Commun., vol. 9, pp. 581–593, February 2010.
- [4] C. Ho and R. Zhang, “Optimal energy allocation for wireless communications powered by energy harvesters,” in IEEE ISIT, June 2010.
- [5] J. Yang and S. Ulukus, “Transmission completion time minimization in an energy harvesting system,” in CISS, March 2010.
- [6] J. Yang and S. Ulukus, “Optimal packet scheduling in an energy harvesting communication system,” IEEE Trans. Comm., submitted June 2010. Also available at [arXiv:1010.1295].
- [7] K. Tutuncuoglu and A. Yener, “Optimum transmission policies for battery limited energy harvesting nodes,” IEEE Trans. Wireless Comm., submitted, September 2010. Also available at [arXiv:1010.6280].
- [8] M. Zafer and E. Modiano, “A calculus approach to energy-efficient data transmission with quality-of-service constraints,” IEEE/ACM Trans. on Networking, vol. 17, pp. 898–911, June 2009.
- [9] A. Fu, E. Modiano, and J. Tsitsiklis, “Optimal energy allocation and admission control for communications sattelites,” IEEE/ACM Trans. on Networking, vol. 11, pp. 488–500, June 2003.
- [10] A. Fu, E. Modiano, and J. N. Tsitsiklis, “Optimal transmission scheduling over a fading channel with energy and deadline constraints,” IEEE Trans. Wireless Commun., vol. 5, pp. 630–641, March 2006.
- [11] B. Prabhakar, E. Uysal-Biyikoglu, and A. El Gamal, “Energy-efficient transmission over a wireless link via lazy scheduling,” in IEEE INFOCOM, April 2001.
- [12] E. Uysal-Biyikoglu and A. El Gamal, “On adaptive transmission for energy efficiency in wireless data networks,” IEEE Trans. Inform. Theory, vol. 50, pp. 3081–3094, December 2004.
- [13] M. Zafer and E. Modiano, “Continuous time optimal rate control for delay constrained data transmission,” in Allerton Conference, September 2005.
- [14] D. P. Bertsekas, Dynamic Programming and Optimal Control. Athena Scientific, 2007.
- [15] D. P. Bertsekas, Convex Analysis and Optimization. Athena Scientific, 2003.
- [16] A. Goldsmith and P. Varaiya, “Capacity of fading channels with channel side information,” IEEE Trans. Inform. Theory, vol. 43, pp. 1986–1992, Nov. 1997.