4.7 Article

Two-Timescale Resource Allocation for Cooperative D2D Communication: A Matching Game Approach

期刊

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
卷 70, 期 1, 页码 543-557

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2020.3046747

关键词

Cooperative D2D; two-timescale resource allocation; matching game; epsilon-stable matching

资金

  1. National Key Research and Development Program of China [213]
  2. ShanghaiMunicipal Natural Science Foundation [19ZR1404700]
  3. China Mobile Chengdu Institute of Research and Development

向作者/读者索取更多资源

This paper considers a cooperative device-to-device communication system, proposing a novel resource allocation scheme and a matching game to address the pairing problem between CUs and D2D pairs, achieving spectrum efficiency improvement and performance enhancement through optimal cooperation strategies.
In this paper, we consider a cooperative device-to-device (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist the densified cellular network users (CUs) for transmission quality of service (QoS) improvement. The proposed system achieves a win-win situation, i.e. improving the spectrum efficiency of the CUs that cannot meet their rate requirement while providing spectrum access for D2D pairs. Unlike previous works, to reduce the overhead, we design a novel two-timescale resource allocation scheme, in which the pairing between CUs and D2D pairs is decided at a long timescale and transmission time for CU and D2D pair is determined at a short timescale. Specifically, to characterize the long-term payoff of each potential CU-D2D pair, we investigate the optimal cooperation policy to decide the transmission time based on the instantaneous channel state information (CSI). We prove that the optimal policy is a threshold policy which can be achieved via binary search. Since CUs and D2D pairs are self-interested, they are paired only when they agree to cooperate mutually. Therefore, to study the cooperation behaviors of CUs and D2D pairs, we formulate the pairing problem as a matching game, based on the long-term payoff achieved by the optimal cooperation policy of each possible pairing. Furthermore, unlike most previous matching models in D2D networks, we allow transfer between CUs and D2D pairs to improve the performance. To solve the pairing problem, a distributed algorithm is proposed, which converges to an epsilon-stable matching. We show that there is a trade-off between the optimality and the computational complexity of the algorithm. We also analyze the algorithm in terms of the robustness to the unilateral deviation of D2D pairs. Finally, the simulation results verify the efficiency of the proposed matching algorithm.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据