In Non-Orthogonal Multiple Access (NOMA)-enabled D2D cellular networks, geographically distributed devices compete for limited channels, making D2D pairing and channel selection a challenging but unexplored research problem. To this end, we formulate an optimization problem from the perspective of game theory with the objective of maximizing the data transmission rate while satisfying geographical and performance constraints, and theoretically prove that it is an Exact Potential Game (EPG). To find such solution, we propose an algorithm called Game-based D2D Pairing and Channel Selection (GDPCS) and prove its convergence. Also, the simulation experiments validate the effectiveness of GDPCS Algorithm and demonstrate its superior to existing state-of-the-art approaches.

中文翻译：

---

用于支持 NOMA 的 D2D 蜂窝网络的 D2D 配对和信道选择的潜在博弈方法


在支持非正交多址 (NOMA) 的 D2D 蜂窝网络中，地理上分布的设备争夺有限的信道，使得 D2D 配对和信道选择成为一个具有挑战性但尚未探索的研究问题。为此，我们从博弈论的角度制定了一个优化问题，其目标是在满足地理和性能约束的情况下最大化数据传输速率，并从理论上证明它是一个精确潜力博弈（EPG）。为了找到这样的解决方案，我们提出了一种称为基于游戏的 D2D 配对和通道选择（GDPCS）的算法并证明了其收敛性。此外，模拟实验验证了 GDPCS 算法的有效性，并证明其优于现有最先进的方法。