A Randomized Algorithm for Joint Power and Channel Allocation in 5G D2D Communication

We formulate the joint power and channel allocation problem (JPCAP) for device to device (D2D) communication as a cost minimization problem, where cost is defined as a linear combination of the number of channels used and total power requirement. We first show that JPCAP is NP-hard and then propose a greedy channel and power allocation (GCPA) algorithm to assign channels and powers to the links. We design GCPA in such a fashion that there exists an order of the links for which it produces optimum solution. Finally using GCPA we develop a randomized algorithm (RA) that increase the optimum hitting probability by an exponential factor of total number of links. Through simulation, we evaluate the performance of RA and show that RA outperforms an existing approach.