523 research outputs found
Optimal offline broadcast scheduling with an energy harvesting transmitter
We consider an energy harvesting transmitter broadcasting data to two receivers. Energy and data arrivals are assumed to occur at arbitrary but known instants. The goal is to minimize the total transmission time of the packets arriving within a certain time window, using the energy that becomes available during this time. An achievable rate region with structural properties satisfied by the two-user AWGN BC capacity region is assumed. Structural properties of power and rate allocation in an optimal policy are established, as well as the uniqueness of the optimal policy under the condition that all the data of the “weaker ” user are available at the beginning. An iterative algorithm, DuOpt, based on block coordinate descent that achieves the same structural properties as the optimal is described. Investigating the ways to have the optimal schedule of two consecutive epochs in terms of energy efficiency and minimum transmission duration, it has been shown that DuOpt achieves best performance under the same special condition of uniqueness. Index Terms Packet scheduling, energy harvesting, AWGN broadcast channel, energy-efficient scheduling
Communicating Using an Energy Harvesting Transmitter: Optimum Policies Under Energy Storage Losses
In this paper, short-term throughput optimal power allocation policies are
derived for an energy harvesting transmitter with energy storage losses. In
particular, the energy harvesting transmitter is equipped with a battery that
loses a fraction of its stored energy. Both single user, i.e. one
transmitter-one receiver, and the broadcast channel, i.e., one
transmitter-multiple receiver settings are considered, initially with an
infinite capacity battery. It is shown that the optimal policies for these
models are threshold policies. Specifically, storing energy when harvested
power is above an upper threshold, retrieving energy when harvested power is
below a lower threshold, and transmitting with the harvested energy in between
is shown to maximize the weighted sum-rate. It is observed that the two
thresholds are related through the storage efficiency of the battery, and are
nondecreasing during the transmission. The results are then extended to the
case with finite battery capacity, where it is shown that a similar
double-threshold structure arises but the thresholds are no longer monotonic. A
dynamic program that yields an optimal online power allocation is derived, and
is shown to have a similar double-threshold structure. A simpler online policy
is proposed and observed to perform close to the optimal policy.Comment: Submitted to IEEE Transactions on Wireless Communications, August
201
Energy Harvesting Networks with General Utility Functions: Near Optimal Online Policies
We consider online scheduling policies for single-user energy harvesting
communication systems, where the goal is to characterize online policies that
maximize the long term average utility, for some general concave and
monotonically increasing utility function. In our setting, the transmitter
relies on energy harvested from nature to send its messages to the receiver,
and is equipped with a finite-sized battery to store its energy. Energy packets
are independent and identically distributed (i.i.d.) over time slots, and are
revealed causally to the transmitter. Only the average arrival rate is known a
priori. We first characterize the optimal solution for the case of Bernoulli
arrivals. Then, for general i.i.d. arrivals, we first show that fixed fraction
policies [Shaviv-Ozgur] are within a constant multiplicative gap from the
optimal solution for all energy arrivals and battery sizes. We then derive a
set of sufficient conditions on the utility function to guarantee that fixed
fraction policies are within a constant additive gap as well from the optimal
solution.Comment: To appear in the 2017 IEEE International Symposium on Information
Theory. arXiv admin note: text overlap with arXiv:1705.1030
Energy Harvesting Broadband Communication Systems with Processing Energy Cost
Communication over a broadband fading channel powered by an energy harvesting
transmitter is studied. Assuming non-causal knowledge of energy/data arrivals
and channel gains, optimal transmission schemes are identified by taking into
account the energy cost of the processing circuitry as well as the transmission
energy. A constant processing cost for each active sub-channel is assumed.
Three different system objectives are considered: i) throughput maximization,
in which the total amount of transmitted data by a deadline is maximized for a
backlogged transmitter with a finite capacity battery; ii) energy maximization,
in which the remaining energy in an infinite capacity battery by a deadline is
maximized such that all the arriving data packets are delivered; iii)
transmission completion time minimization, in which the delivery time of all
the arriving data packets is minimized assuming infinite size battery. For each
objective, a convex optimization problem is formulated, the properties of the
optimal transmission policies are identified, and an algorithm which computes
an optimal transmission policy is proposed. Finally, based on the insights
gained from the offline optimizations, low-complexity online algorithms
performing close to the optimal dynamic programming solution for the throughput
and energy maximization problems are developed under the assumption that the
energy/data arrivals and channel states are known causally at the transmitter.Comment: published in IEEE Transactions on Wireless Communication
- …