基于分簇和Stackelberg博弈的D2D资源分配策略  

D2D resource allocation strategy based on clustering and Stackelberg game

作　　者：刘会衡 肖瑶[1,3] 程晓红 张军 Liu Huiheng;Xiao Yao;Cheng Xiaohong;Zhang Jun(School of Physics&Electronic Engineering,Hubei University of Arts&Science,Xiangyang Hubei 441053,China;Hubei Provincial Engineering Research Center of Emergency Communication Technology&System,Hubei University of Arts&Science,Xiangyang Hubei 441053,China;School of Mechanical Engineering,Hubei University of Arts&Science,Xiangyang Hubei 441053,China;Hubei Key Laboratory of Low Dimensional Optoelectronic Materials&Devices,Hubei University of Arts&Science,Xiangyang Hubei 441053,China)

机构地区：[1]湖北文理学院物理与电子工程学院,湖北襄阳441053 [2]湖北文理学院应急通信技术与系统湖北省工程研究中心,湖北襄阳441053 [3]湖北文理学院机械工程学院,湖北襄阳441053 [4]湖北文理学院低维光电材料与器件湖北省重点实验室,湖北襄阳441053

出　　处：《计算机应用研究》2023年第3期880-884,889,共6页Application Research of Computers

摘　　要：当前,车辆密集通信场景下存在通信资源利用率低、DUE(D2D user)用户通信质量差等问题。针对上述问题,提出了一种基于分簇和Stackelberg博弈的D2D(device to device)资源分配策略,以解决DUE用户功率分配、信道匹配问题。首先,基于每个信道内DUE用户之间干扰最小原则,该模型对所有DUE用户进行分簇;然后,对于CUE(cellular user)用户与DUE用户簇,构建一对多的Stackelberg主从博弈模型,通过复用链路干扰参数和簇内干扰参数的迭代更新,优化每个DUE用户的发射功率;最后,利用匈牙利算法实现DUE用户簇与CUE用户的最佳信道匹配,最大化DUE用户的容量和。仿真结果表明,与基于价格迭代、等功率分配和高能效干扰约束的几种功率分配算法相比,所提算法能有效提升DUE用户的总容量。At present, there are some problems in dense vehicle communication scenarios, such as low utilization of communication resources and poor communication quality of D2D users(DUE).To solve the problems of DUE power allocation and channel matching, this research proposed a D2D resource allocation strategy based on clustering and Stackelberg game.Firstly, based on the principle of least interference between DUE in each channel, this model clustered all DUE;then, for the cellular user(CUE) and the cluster of DUE,it constructed a one-to-many Stackelberg master-slave game model.It optimized the transmission power of each DUE by iterative update of link interference parameters and intra-cluster interference parameters.Finally, it realized the optimal channel matching between clusters of DUE and CUE by the Hungarian algorithm and obtained the maximum total capacity of DUE.The simulation results show that, compared with several power allocation algorithms based on price iteration, equal power allocation and energy-efficient interference constraints, the proposed algorithm can effectively improve the total capacity of DUE.

关 键 词：D2D 分簇 STACKELBERG博弈 资源分配 

分 类 号：TN929.5[电子电信—通信与信息系统]