用于在OFDMA蜂窝网络下面/上面的D2D通信的分布式功率分配
Distributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks
摘要：
由于增强总小区吞吐量、降低功耗和增加瞬时数据率的潜力，在预先存在的蜂窝网络之下或之上的设备到设备（D2 D）的实现已经受到很多关注。在本文中，我们提出了一种分布式功率分配方案D2 D OFDMA通信，特别是，我们认为这两种操作模式适合分布式实现：专用和重用模式。所提出的方案解决的问题，最大化用户的总速率受到功率约束，这是已知的非凸的，因此，非常难以精确求解。我们在这里提出了一个新的方法来解决这个众所周知的问题，利用的事实，即权力分配问题可以建模为一个潜在的游戏。利用更好的响应动态下收敛的潜在游戏属性，我们提出了两个完全分布式的迭代算法，一个为每个操作模式考虑，每个用户顺序更新和自主的功率分配。数值结果表明，计算几个不同的用户场景，所提出的方法，收敛到目标函数的局部最大值之一，表现出接近最大可实现的最佳性能，优于文献中提出的其他计划。
英文摘要：
The implementation of device-to-device (D2D) underlaying or overlaying pre-existing cellular networks has received much attention due to the potential of enhancing the total cell throughput, reducing power consumption and increasing the instantaneous data rate. In this paper we propose a distributed power allocation scheme for D2D OFDMA communications and, in particular, we consider the two operating modes amenable to a distributed implementation: dedicated and reuse modes. The proposed schemes address the problem of maximizing the users' sum rate subject to power constraints, which is known to be nonconvex and, as such, extremely difficult to be solved exactly. We propose here a fresh approach to this well-known problem, capitalizing on the fact that the power allocation problem can be modeled as a potential game. Exploiting the potential games property of converging under better response dynamics, we propose two fully distributed iterative algorithms, one for each operation mode considered, where each user updates sequentially and autonomously its power allocation. Numerical results, computed for several different user scenarios, show that the proposed methods, which converge to one of the local maxima of the objective function, exhibit performance close to the maximum achievable optimum and outperform other schemes presented in the literature.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
