Cooperative Distributed Resource Allocation in Heterogeneous Networks With D2D Communication

Abstract

With the explosive increase of intelligent applications and smart terminals, the high-speed transmission is the fundamental requirement for the future network. As a powerful deployment strategy, the heterogeneous network (HetNet) is of great significance for improving network throughput. This article investigates the resource allocation problem in the HetNet with device-to-device (D2D) communication, where sub-channel allocation and power allocation are jointly optimized to maximize the network throughput under the constraints of sub-channel allocation, transmitting power and throughput. The formulated optimization problem is a mixed-integer non-linear programming (MINLP) problem, which is difficult to be solved directly, due to the coupling of discrete sub-channel allocation variables and continuous power optimization variables. To deal with this issue, the time sharing factor (TSF) method is exploited to transform the original MINLP problem into a tractable continuous problem. Since the traditional centralized schemes necessarily aggravates computational burden on the central node and reduces network reliability, an integrated cooperative distributed resource allocation algorithm (CDRAA) is proposed in this article, where all the small base stations (SBSs) and macro base stations (MBSs) cooperatively participate in resource allocation instead of the unique manipulation by the central node. Simulation results demonstrate the performance gap and the running time comparison between the proposed algorithms and the centralized algorithm. In addition, the convergence of the proposed algorithms is verified in several different network settings. The network throughput achieved by the proposed CDRAA is higher than that obtained by the alternating optimization (AO) algorithm and the centralized algorithm based on the TSF method when a great number of sub-channels is provided.

Topics & Concepts