Low-complexity uplink resource allocation algorithm based on hypergraph clustering for D2D communications

This paper investigates the Device-to-Device (D2D) communications uplink resource allocation algorithm facing to arbitrary D2D pairs sharing subchannels with multiple cellular users (CUEs). Aiming to optimize the network sum rate, the complexity is considerable due to the flexible interference relation. To reduce the complexity, the problem can be decomposed based on the time variance by two sub-problems: subchannel allocation and power allocation. For subchannel allocation, a clustering algorithm based on the hypergraph similarity of UEs is proposed, which constructs the D2D sharing set to enhance the clustering efficiency and conduces the complexity to be 0(N2). For power allocation, a bisection algorithm which can rapidly converge to the optimal solution is introduced to further promote the system throughput. Simulation results demonstrate that the proposed algorithm can achieve a superior sum rate performance compared to the conventional graph algorithm.