Online Energy Harvesting Problem Over An Arbitrary Directed Acyclic Graph Network

by   Rahul Vaze, et al.

A communication network modelled by a directed acyclic graph (DAG) is considered, over which a source wishes to send a specified number of bits to a destination node. Each node of the DAG is powered by a separate renewable energy source, and the harvested energy is used to facilitate the source destination data flow. The challenge here is to find the optimal rate and power allocations across time for each node on its outgoing edges so as to minimize the time by which the destination receives a specified number of bits. An online setting is considered where an algorithm only has causal information about the energy arrivals. Using the competitive ratio as the performance metric, i.e. the ratio of the cost of the online algorithm and the optimal offline algorithm, maximized over all inputs, a lazy online algorithm with a competitive ratio of 2+δ for any δ>0 is proposed. Incidentally, 2 is also a lower bound to the competitive ratio of any online algorithm for this problem. Our lazy online algorithm is described and analyzed via defining a novel max-flow problem over a DAG, where the rate on the subset of outgoing edges of any node are related/constrained. An optimal algorithm to find max-flow with these constraints is also provided, which may be of independent interest.



There are no comments yet.


page 1

page 2

page 3

page 4


Timely Updates in Energy Harvesting Two-hop Networks: Offline and Online Policies

A two-hop energy harvesting communication network is considered, in whic...

Tight Bounds for Online Graph Partitioning

We consider the following online optimization problem. We are given a gr...

A Continuous Max-Flow Approach to Multi-Labeling Problems under Arbitrary Region Regularization

The incorporation of region regularization into max-flow segmentation ha...

An Optimal Algorithm for Online Freeze-tag

In the freeze-tag problem, one active robot must wake up many frozen rob...

Quantum Online Streaming Algorithms with Constant Number of Advice Bits

Online algorithms are known model that is investigated with respect to a...

Data-Oriented Algorithm for Real-Time Estimation of Flow Rates and Flow Directions in a Water Distribution Network

The aim of this paper is to present how data collected from a water dist...

Message Delivery in the Plane by Robots with Different Speeds

We study a fundamental cooperative message-delivery problem on the plane...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.