Resource Allocation Algorithm for D2D Communication in Cellular Networks Based on Hungarian Algorithm

Device to device communication is a vital technology when it comes to the future communication system. It can increase the sum rate, area coverage and decreases the latency of the network. However, the interference caused by introducing D2D communication can affect the overall performance of the cellular network. In this paper, we proposed a resource allocation algorithm using the fair and restricted assignment for D2D communication. The advantage of our proposed algorithm is that it decreases the total system interference while maintaining the target sum rate. We have divided our algorithm into two parts. Part I, assigns the resources of the cellular user to D2D pair using Hungarian Minimisation and Maximization algorithm(weight bipartite matching) considering two separate cases (fair and restricted assignment). In cases where the system sum rate doesn’t satisfy the target sum rate, a single cellular user shares its resources to two different D2D pair (while maintaining the system sum rate). Part II further checks and decreases the interference by using local interference management technique. The results were compared to other existing algorithms like TAFIRA and MIKIRA. The simulation results proves that our algorithm shows superior performance results in terms of minimization of interference and maintaining the target sum rat