低复杂度室内超密集可见光通信网络频谱资源分配算法

Low-Complexity Spectrum Resource Allocation Algorithm for Indoor Ultra-Dense Visible Light Communication Networks

针对室内超密集可见光通信网络多小区资源分配算法中存在的吞吐性能与算法复杂度之间的矛盾,提出一种吞吐性能近似最优且复杂度低的资源分配算法。通过建立各小区资源分配问题的最优化模型,得出该问题是凸优化问题的,结论;在合理近似处理后,推导了终端资源分配归一化比例因子的解析式,在此基础上提出一种资源分配算法;算法复杂度分析表明本文算法具有多项式复杂度,低于经典最优化内点法。仿真表明,相比于请求速率占比分配法,本文算法的吞吐量性能提升了57%,服务质量满意度性能提升了67%。

A low-complexity spectrum resource allocation algorithm with near-optimal system throughput is proposed to resolve the conflict between high system throughput and low complexity of the multi-cell resource allocation algorithm for indoor ultra-dense visible light communication(UD-VLC)networks.Firstly,through establishing the optimal model of the resource allocation problem in each cell,we derive the conclusion that the problem is a convex optimization problem.Then,the analytic formula of the normalized scaling factor of each terminal for resource allocation is derived after reasonable approximate treatment,and the resource allocation algorithm is proposed.Finally,the complexity analysis shows that the proposed algorithm has polynomial complexity,which is lower than the classical optimal inter-point method.The simulation results show that the proposed method achieves 57%performance improvement on average system throughput and 67%performance improvement on quality of service(QoS)satisfaction against the required data rate proportion allocation(RDR-PA)method.