Resource allocation for device-to-device (d2d) communication in underlaying cellular network

Abstract

The increasing demand for underlaying cellular network has benefit form Device-to-Device (D2D) communication, where one need to apply productive plan for resource allocation to increase system capacity and mitigate interference. The bipartite graph matching strategy is used for optimizing the resource allocation among all other strategies; Kuhn-Munkres (KM) is one of algorithm applied to increase system capacity. In this paper we had considered different D2D communication parameters, such as comparison of KM with Hopcroft-krap (HK) algorithm, mobility of nodes and different values of path-loss exponent which changes assignment matrix. Simulation results discuss the comparison of computational time between HK and KM algorithm. The result also shows that the change in path-loss exponent value and assignment value of the system changes with adding one node in existing scenario.