Renewable Energy Sharing among Base Stations as a Min-Cost-Max-Flow Optimization Problem

Doris Benda, Xiaoli Chu, Sumei Sun, Tony Q.S. Quek, Alastair Buckley

研究成果: Article同行評審

13 引文 斯高帕斯(Scopus)

摘要

Limited work has been done to optimize the power sharing among base stations (BSS) while considering the topology of the cellular network and the distance-dependent power loss (DDPL) in the transmission lines. In this paper, we propose two power sharing optimization algorithms for energy-harvesting BSS: The max-flow (MF) algorithm and the min-cost-max-flow (MCMF) algorithm. The two proposed algorithms minimize the power drawn from the main grid by letting BSS with power surpluses transmit harvested power to BSS with deficits. The MCMF algorithm has an additional DDPL cost associated with each transmission line. Hence, the MCMF algorithm shares the harvested power over shorter distances and loses less power during the transmission than the MF algorithm. Our numerical results show that for a fully connected cellular network, i.e., every pair of BSS can share power, with a moderate power loss coefficient per l (€ ℝ+) meters of transmission line, the MCMF algorithm saves up to 10%, 22%, and 30% more main grid power than the MF algorithm for 5, 10, and 15 BSS uniformly distributed in a square area of l-2 square meters, respectively.

原文English
文章編號8491374
頁(從 - 到)67-78
頁數12
期刊IEEE Transactions on Green Communications and Networking
3
發行號1
DOIs
出版狀態Published - 2019 3月

All Science Journal Classification (ASJC) codes

  • 可再生能源、永續發展與環境
  • 電腦網路與通信

指紋

深入研究「Renewable Energy Sharing among Base Stations as a Min-Cost-Max-Flow Optimization Problem」主題。共同形成了獨特的指紋。

引用此