Matching and Cheating in Device to Device Communications Underlying Cellular Networks

Abstract

In device-to-device (D2D) communication, mobile users communicate directly without going through the base station. D2D commutation has the advantage of improving spectrum efficiency. But the interference introduced by resource sharing of D2D has become a significant challenge. In this paper, we try to optimize the system throughput while simultaneously meet the quality of service (QoS) requirements for both D2D users and cellular users (CUs). We implement matching theory to solve the resource allocation problem. We utilize two efficient stable matching algorithms to optimize the social welfare while ensuring the network stability. More importantly, we introduce the idea of cheating in matching to further improve D2D users' throughput. The cheating mechanism is proven to be able to benefit a subset of D2D users without hurting the performance of the rest. Through the simulation results, we demonstrate the effectiveness of both the stable matching and cheating algorithms in terms of improving both D2D users and the overall throughput in D2D communications.

Cooperative Game-based Cheating in Full-duplex Relaying-based D2D Communication Underlaying Heterogeneous Cellular Networks

“…3) Run the men-optimal stable matching algorithm with the falsified preferences. Thus, in the resulting matching, all D2D users within cabal are better off while the rest of D2D users keep the same partners [15].…”

“…CUs in this paper) and the users (e.g. D2D pairs in this paper) [15]. In fact, an unstable matching may cause the case where D2D users switch to reuse other cellular users' spectrum resource when the switch can benefit all of them.…”

“…Recently, most of the related research applied new mathematical tools such as game theory [22,26], graph theory [32,34] and matching theory [14,15] to solve the resource allocation problems in D2D communications. In [22], considering a small-cell scenario in which full-duplex base station communicates with half-duplex D2D users, an iterative algorithm is proposed based on game theory by modeling the problem as a non-cooperative game between the uplink and downlink channels.…”

“…The case will cause the failure of the resource allocation scheme. Gu et al [14,15] implement matching theory to find a stable and efficient resource allocation method, which not only takes welfare into consideration but also guarantees stability in D2D communications. Moreover, the authors introduce the idea of cheating in matching to further improve D2D users' throughput.…”

“…Moreover, the authors introduce the idea of cheating in matching to further improve D2D users' throughput. However, the throughput performance of the algorithm in [14] is far from optimal and the complexity of the algorithm in [15] is too high to formulate.…”