蜂窝下含D2D系统基于二部超图的资源分配  

Resource Allocation for D2D Communication Underlaid Cellular Networks Using Bipartite Hypergraph

作　　者：王振朝[1,2] 赵云[1] 薛文玲[1] WANG Zhen-chao ZHAO Yun XUE Wen-ling(College of Electronic ＆ Informational Engineering, Hebei University, Baoding 071002, China Key Laboratory of Digital Medical Engineering of Hebei Province, Baoding 071002, China)

机构地区：[1]河北大学电子信息工程学院,保定071002 [2]河北省数字医疗工程重点实验室,保定071002

出　　处：《计算机科学》2017年第8期82-85,94,共5页Computer Science

基　　金：河北省自然基金项目(F2014201168)资助

摘　　要：针对蜂窝下含D2D系统的资源分配问题,提出一种基于二部超图的资源分配算法。首先,以最大化系统和速率为目标,将该问题建模为一个整数规划问题。为求解该NP-hard问题,相继提出二部超图的概念、二部超图边的感知比较构造法则以及基于二部超图的链路匹配算法。仿真结果表明,与二部图算法相比,所提算法在同等条件下可将系统频谱效率提升40b/s/Hz左右,同时可将系统容量提升0.5倍左右。In this paper,we proposed a bipartite hypergraph based spectrum sharing algorithm in device-to-device（D2D）underlaid cellular network.Our design aims to maximize the system sum-rate assuming that each channel can be assigned to multi-links.To solve this NP-hard problem,we proposed the concept of bipartite hypergraph,construction rules of hyper-edges,and optimal matching algorithm.Simulation results show that,compared with the weighted bipartite graph based algorithm,the system sum-rate can be increased approximately by 40b/s/Hz and the system capacity can be improved about 50% through our algorithm.

关 键 词：D2D通信 资源分配 图论 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]