Energy-Efficient Matching for Resource Allocation in D2D Enabled Cellular Networks
Energy-Efficient Matching for Resource Allocation in D2D Enabled Cellular Networks
复制标题
D2D 蜂窝网络中资源分配的节能匹配
DOI：
10.1109/tvt.2016.2615718
复制
发表时间：
2017-06-01
影响因子：
6.8
通讯作者：
Xu, Chen
中科院分区：
文献类型：
--
作者：
Zhou, Zhenyu;Ota, Kaoru;Xu, Chen
由于有限的电池容量和严重的同信道干扰，能量效率（EE）对于支持设备到设备（D2 D）的蜂窝网络至关重要。在本文中，我们解决EE优化问题，采用稳定匹配的方法。NP-hard联合资源分配问题被表示为双边偏好下的一对一匹配问题，双边偏好随信道状态和干扰水平动态变化。采用博弈论方法分析了用户设备之间的相互作用和相关性，并基于非线性分式规划提出了一种迭代功率分配算法来建立用户设备之间的相互偏好.然后，我们采用Gale-Shapley算法来匹配D2 D对与蜂窝UE，这被证明是稳定的和弱帕累托最优的。我们提供了一个理论分析和描述的实现细节和算法的复杂性。我们还扩展了算法，以解决在大规模网络的可扩展性问题，通过开发平局打破和偏好删除为基础的匹配规则。仿真结果验证了理论分析的正确性，并表明该算法在平均EE和匹配满意度方面有显著的性能提升。
Energy-efficiency (EE) is critical for device-to-device (D2D) enabled cellular networks due to limited battery capacity and severe cochannel interference. In this paper, we address the EE optimization problem by adopting a stablematching approach. The NP-hard joint resource allocation problem is formulated as a one-to-one matching problem under two-sided preferences, which vary dynamically with channel states and interference levels. A game-theoretic approach is employed to analyze the interactions and correlations among user equipments (UEs), and an iterative power allocation algorithm is developed to establish mutual preferences based on nonlinear fractional programing. We then employ the Gale-Shapley algorithm to match D2D pairs with cellular UEs, which is proved to be stable and weak Pareto optimal. We provide a theoretical analysis and description for implementation details and algorithmic complexity. We also extend the algorithm to address scalability issues in large-scale networks by developing tie-breaking and preference-deletion-based matching rules. Simulation results validate the theoretical analysis and demonstrate that significant performance gains of average EE and matching satisfactions can be achieved by the proposed algorithm.