一种超密集网络基站分簇管理算法

摘要

In order to reduce the computational complexity of base station management algorithm in ultra-dense network( UDN) and improve the energy usage efficiency of it, a cluster-based dynamic management base station method is proposed on the basis of customer density and network capacity. According to this algorithm, the theoretical minimum number of needed base station is first calculated based on user meas-urement report, then the base station is clustered in a proper manner, finally the hibernation combination of base station is determined through Particle Swarm Optimization( PSO) . The simulation result shows that compared with those base station algorithms without being clustered, the proposed algorithm can reduce the computational complexity by about 60% and effectively cut down the energy consumption of base station.%为了降低超密集网络中基站管理算法的计算复杂度并提升基站的能源使用效率,根据用户密度、网络负载量等信息,提出了一种基于分簇的动态管理基站算法.该算法首先根据用户测量报告计算出理论最小需求基站数,然后对基站进行合理的网络分簇,最终通过粒子群优化算法确定基站休眠组合.仿真结果表明,与未进行分簇的基站管理算法相比,该算法可以降低约60%的计算复杂度,并能有效降低基站能源消耗.