首页> 外文期刊>IEEE Transactions on Green Communications and Networking >Renewable Energy Sharing Among Base Stations as a Min-Cost-Max-Flow Optimization Problem
【24h】

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

机译:最小成本最大流量优化问题在基站之间的可再生能源共享

获取原文
获取原文并翻译 | 示例

摘要

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 (∈ R
机译:在考虑蜂窝网络的拓扑和传输线中与距离相关的功率损耗(DDPL)的同时,已经做了有限的工作来优化基站(BS)之间的功率共享。在本文中,我们提出了两种用于能量收集基站的功率共享优化算法:最大流量(MF)算法和最小成本最大流量(MCMF)算法。所提出的两种算法通过让具有功率余量的BS将收集的功率传输到具有赤字的BS来最小化从主电网获取的功率。 MCMF算法具有与每条传输线相关的额外DDPL成本。因此,与MF算法相比,MCMF算法在较短的距离上共享所收集的功率,并且在传输过程中损失的功率更少。我们的数值结果表明,对于完全连接的蜂窝网络,即每对BS可以共享功率,每l的功率损耗系数中等(∈R

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号