检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李校林[1,2] 唐虹 朱彬欣[1] LI Xiao-lin;TANG Hong;ZHU Bin-xin(Research Center of New Telecommunications Applications,Chongqing University of Post and Telecommunications,Chongqing 400065,China;Chongqing Information Technology Designing Limited Company,Chongqing 401121,China)
机构地区:[1]重庆邮电大学通信新技术应用研究中心,重庆400065 [2]重庆信科设计有限公司,重庆401121
出 处:《计算机工程与设计》2019年第5期1259-1263,1287,共6页Computer Engineering and Design
摘 要:为解决中继协助下的D2D通信干扰协调问题,提出一种联合功率控制、中继选择与资源分配方案最大化系统的吞吐量。将系统目标函数转化为功率控制、中继选择与资源分配的两个子问题,在功率控制问题上将原有的子问题转换为线性分数规划问题,通过Dinkelbach算法得到最优发射功率,在中继选择与资源分配的问题上将其转化为图论中最大匹配问题,采用匈牙利算法得出其最优解。实验结果表明,该方案能够有效提高系统总的吞吐量以及频谱效率。To solve the coordination interference problem of D2D communication assisted by relay,a joint power control,relay selection and resource allocation scheme was proposed to maximize the throughput of the system.The system objective function was transformed into power control,relay selection and resources.The original sub-problem was converted into a linear fractio- nal programming problem on the power control problem.The optimal transmit power was obtained using the Dinkelbach algorithm,and it was transformed into the maximum matching problem of graph theory on the issue of relay selection and resource allocation.The Hungarian algorithm was used to derive its optimal solution.Experimental results show that the proposed scheme can effectively improve the total throughput and spectrum efficiency of systems.
关 键 词:D2D通信 功率控制 资源分配 中继选择 Dinkelbach算法 匈牙利算法
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3