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

Resource Allocation for D2D Communications Underlaying Cellular Networks Using Directed Weighted Bipartite

针对蜂窝下含D2D系统最多允许一条蜂窝链路和一条D2D对链路同时共占信道的场景,旨在设计一种低复杂度的资源分配算法。首先将以最大化系统吞吐量为目标的资源分配问题归结为整数规划问题。考虑到干扰是决定两条链路能否共占信道的关键因素,将最优化问题转化为以最小化干扰链路信道增益为目标的问题;该问题可看作一对一双偏好最优匹配问题,为此,首次提出有向加权二部图的相关概念,并用它对最优化问题建模。为了降低寻找最优匹配的难度,提出一种贪婪算法,该算法复杂度仅为O(n)。仿真表明,与加权二部图算法相比,所提算法不仅在复杂度方面下降两个数量级,而且在一定范围内得到的系统吞吐量与容量等性能比加权二部图算法略优。

This paper aimed to design a resource allocation algorithm with low complexity in D2D underlaid cellular net- works where at most one D2D pair and one cellular user can reuse a same channel. An integer program is formed to maximize throughput. Then it is transformed to an integer program to minimize the sum of interference channel gains, because interference is thought to be the most effective factor to decide whether two links can use a same channel. In or- der to solve the optimization problem which can be seen as a one-to one matching problem, directed weighted bipartite and relative definitions were firstly proposed. Then, a greedy algorithm, whose complexity is only O（n）, was proposed to search optimal match pairs. Simulation results show that our algorithm can achieve better throughput and capacity than the weighted bipartite algorithm in certain range while the complexity is reduced two orders of magnitude.