Graph Theory based Resource Allocation Algorithm in Terahertz Communication Networks

Abstract

Terahertz (THz) communication is considered to be a promising technology in B5G communication systems. Efficient resource allocation algorithms play an important role in THz communication systems. In this paper, a graph theory based resource allocation algorithm is proposed for THz communication networks. The resource allocation is formulated into an optimization problem, which is a Mixed-Integer Nonlinear Programming (MINLP) problem. We thus divide it into subchannel allocation and power allocation problems. In the subchannel allocation problem, we transform it into a bipartite graph optimal matching problem, and propose a network flow algorithm to solve it. In the power allocation problem, we optimize the power allocation of each subchannel by penalty function method on the basis of subchannel allocation. Simulation results show that the proposed scheme has better performance than that based on long-user-central-window (LUCW) principle.