Name
Abstract | ||
|---|---|---|
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
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">lazy</italic>
online algorithm with a competitive ratio of
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2{\pmb {+}}\delta $ </tex-math></inline-formula>
for any
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\delta >0$ </tex-math></inline-formula>
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TGCN.2019.2938006 | IEEE Transactions on Green Communications and Networking |
Keywords | Field | DocType |
Throughput,energy harvesting,data communication,energy management systems | Computer science,Energy harvesting,Directed acyclic graph,Theoretical computer science | Journal |
Volume | Issue | Citations |
3 | 4 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rahul Vaze | 1 | 463 | 45.64 |
| Sibi Raj B. Pillai | 2 | 15 | 10.10 |