arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.00200cs.NI
收藏

基于社会蜘蛛算法的绿色蜂窝网络基站切换问题

Base Station Switching Problem for Green Cellular Networks with Social Spider Algorithm

James J. Q. Yu, Victor O. K. Li

摘要:

随着最近移动数据的爆炸式增长,移动通信行业的能源消耗和碳足迹正在迅速增加。必须开发更节能的系统,以减少对环境的潜在有害影响。一个可能的策略是在非高峰时段关闭一些未充分利用的基站。在本文中,我们提出了一个二进制的社会蜘蛛算法,为选择基站关闭的指导方针。在我们的实现中,我们使用惩罚函数来制定问题,并设法绕过原始优化问题中的大量约束。我们采用几个随机生成的蜂窝网络进行仿真,结果表明,我们的算法可以产生优越的性能。

英文摘要:

With the recent explosion in mobile data, the energy consumption and carbon footprint of the mobile communications industry is rapidly increasing. It is critical to develop more energy-efficient systems in order to reduce the potential harmful effects to the environment. One potential strategy is to switch off some of the under-utilized base stations during off-peak hours. In this paper, we propose a binary Social Spider Algorithm to give guidelines for selecting base stations to switch off. In our implementation, we use a penalty function to formulate the problem and manage to bypass the large number of constraints in the original optimization problem. We adopt several randomly generated cellular networks for simulation and the results indicate that our algorithm can generate superior performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑