Relax online resource allocation algorithms for D2D communication

Abstract

Summary Maximizing the system sumrate by sharing the resource blocks among the cellular user equipments and the D2D (device to device) pairs while maintaining the quality of service is an important research question in a D2D communication underlaying cellular networks. The problem can be optimally solved in offline by using the weighted bipartite matching algorithm. However, in long‐term evolution and beyond (4G and 5G) systems, scheduling algorithms should be very efficient where the optimal algorithm is quite complex to implement. Hence, a low complexity algorithm that returns almost the optimal solution can be an alternative to this research problem. In this paper, we propose 2 less complex stable matching–based relax online algorithms those exhibit very close to the optimal solution. Our proposed algorithms deal with fixed number of cellular user equipments and a variable number of D2D pairs those arrive in the system online. Unlike online matching algorithms, we consider that an assignment can be revoked if it improves the objective function (total system sumrate). However, we want to minimize the number of revocation (ie, the number of changes in the assignments) as a large number of changes can be expensive for the networks too. We consider various offline algorithms proposed for the same research problem as relaxed online algorithms. Through extensive simulations, we find that our proposed algorithms outperform all of the algorithms in terms of the number of changes in assignment between 2 successive allocations while maintaining the total system sumrate very close to the optimal algorithm.

An online resource allocation algorithm to minimize system interference for inband underlay D2D communications

“…It should be mentioned that, so far as we know, no online algorithm is available to solve the addressed research problem. Although there is one online algorithm that handles a different research problem, ie, maximize the total system sum rate maintaining QoS constraint, two less complex stable matching based relax online algorithms are proposed in Hossen et al, and those exhibit very close to the optimal solution. The system model of this work considers the cellular UEs as a set of constant elements and D2D pairs as a set of variable elements.…”

“…An alternative approach to finding the solution of the addressed problem can be an online algorithm, which runs on a smaller portion of the input. A few research works exploit online algorithm but none of them address the issue of interference minimization, which is addressed in this paper.…”