On the Virtual Cell Power Allocation in Ultra Dense Networks

摘要

Ultra-dense network (UDN) can meet ultra-high peak rate, traffic density and density by densely deploying low-power base stations (BSs). The traditional iterative search water filling (ISWF) algorithm requires many iterations to obtain the optimal power allocation. We adopt a low-complexity iterative water filling (LAWF) algorithm to reduce iterations. We propose sorting water filling (SWF) algorithm. The simulation results show that the sum rate achieved by the LAWF and SWF are better than ISWF. With deployment of UDN, speed and presentation of SWFs are increasing.