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

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number8491374
Pages (from-to)67-78
Number of pages12
JournalIEEE Transactions on Green Communications and Networking
Volume3
Issue number1
DOIs
Publication statusPublished - 2019 Mar

All Science Journal Classification (ASJC) codes

  • Renewable Energy, Sustainability and the Environment
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Renewable Energy Sharing among Base Stations as a Min-Cost-Max-Flow Optimization Problem'. Together they form a unique fingerprint.

Cite this