下含D2D蜂窝网基于有向加权二部图的资源分配

发布时间：2018-03-14 02:57

本文选题：DD通信　切入点：资源分配　出处：《计算机科学》2017年09期 　论文类型：期刊论文

【摘要】：针对蜂窝下含D2D系统最多允许一条蜂窝链路和一条D2D对链路同时共占信道的场景,旨在设计一种低复杂度的资源分配算法。首先将以最大化系统吞吐量为目标的资源分配问题归结为整数规划问题。考虑到干扰是决定两条链路能否共占信道的关键因素,将最优化问题转化为以最小化干扰链路信道增益为目标的问题;该问题可看作一对一双偏好最优匹配问题,为此,首次提出有向加权二部图的相关概念,并用它对最优化问题建模。为了降低寻找最优匹配的难度,提出一种贪婪算法,该算法复杂度仅为O(n)。仿真表明,与加权二部图算法相比,所提算法不仅在复杂度方面下降两个数量级,而且在一定范围内得到的系统吞吐量与容量等性能比加权二部图算法略优。
[Abstract]:For scenarios where a D2D system under a cell allows at most one cellular link and one D2D pair of links to share the channel at the same time, In this paper, a low complexity resource allocation algorithm is designed. Firstly, the resource allocation problem aiming at maximizing system throughput is reduced to integer programming problem. Considering that interference is the key factor to determine whether the two links can co-occupy the channel, The optimization problem is transformed into a problem aimed at minimizing the gain of interference link channels, which can be regarded as a one-to-one bipartite preference optimal matching problem. For this reason, a new concept of directed weighted bipartite graph is proposed for the first time. In order to reduce the difficulty of finding the optimal matching, a greedy algorithm is proposed. The complexity of the algorithm is only OFN. The simulation results show that compared with the weighted bipartite graph algorithm, the proposed algorithm is more efficient than the weighted bipartite graph algorithm. The proposed algorithm not only reduces the complexity by two orders of magnitude, but also has better system throughput and capacity than the weighted bipartite graph algorithm in a certain range.
【作者单位】：河北大学电子信息工程学院;河北省数字医疗工程重点实验室;
【基金】：河北省自然科学基金项目(F2014201168)资助
【分类号】：O157.5;TN929.53

【相似文献】