Utility Optimal Scheduling in Energy-Harvesting Networks
Utility Optimal Scheduling in Energy-Harvesting Networks
复制标题
DOI：
10.1109/tnet.2012.2230336
复制
发表时间：
2013-08-01
影响因子：
3.7
通讯作者：
Neely, Michael J.
中科院分区：
文献类型：
--
作者：
Huang, Longbo;Neely, Michael J.
在本文中，我们展示了如何在仅使用有限容量储能设备的能量收集网络中实现接近最佳的公用事业性能。在这些网络中，节点能够从环境中获取能量。可以收集的能量量是随时间变化的，并且根据某种概率定律演变。我们开发了一种在线算法，称为能量限制调度算法（ESA），它共同管理能量并为数据包传输做出功率分配决策。 ESA 只需跟踪网络节点上剩余的能量，不需要任何可收获能量过程的知识。我们表明，对于任何 epsilon > 0，ESA 实现了在 O(epsilon) 范围内的最优效用，同时确保网络拥塞和能量存储设备所需的容量确定性地以大小 O(1/epsilon) 为上限。然后，我们还开发了 Modified-ESA (MESA) 算法，以实现相同的 O(epsilon) 接近实用性能，平均网络拥塞和储能设备所需容量仅为 O([log(1/epsilon)](2))，接近理论下限 O(log(1/epsilon))。
In this paper, we show how to achieve close-to-optimal utility performance in energy-harvesting networks with only finite capacity energy storage devices. In these networks, nodes are capable of harvesting energy from the environment. The amount of energy that can be harvested is time-varying and evolves according to some probability law. We develop an online algorithm, called the Energy-limited Scheduling Algorithm (ESA), which jointly manages the energy and makes power allocation decisions for packet transmissions. ESA only has to keep track of the amount of energy left at the network nodes and does not require any knowledge of the harvestable energy process. We show that ESA achieves a utility that is within O(epsilon) of the optimal, for any epsilon > 0, while ensuring that the network congestion and the required capacity of the energy storage devices are deterministically upper-bounded by bounds of size O(1/epsilon). We then also develop the Modified-ESA (MESA) algorithm to achieve the same O(epsilon) close-to-utility performance, with the average network congestion and the required capacity of the energy storage devices being only O([log(1/epsilon)](2)), which is close to the theoretical lower bound O(log(1/epsilon)).