首页 | 本学科首页   官方微博 | 高级检索  
     

基于灰狼优化和匈牙利算法的D2D资源分配策略
引用本文:肖瑶,刘会衡,程晓红,安忙忙.基于灰狼优化和匈牙利算法的D2D资源分配策略[J].计算机应用研究,2022,39(5):1529-1533.
作者姓名:肖瑶  刘会衡  程晓红  安忙忙
作者单位:湖北文理学院机械工程学院,湖北襄阳441053;湖北文理学院物理与电子工程学院,湖北襄阳441053,湖北文理学院物理与电子工程学院,湖北襄阳441053,湖北文理学院低维光电材料与器件湖北省重点实验室,湖北襄阳441053
摘    要:当前,车联网系统中存在频谱资源有限、系统干扰较大、D2D(device to device)用户通信质量差等问题。针对上述情况,提出了一种基于灰狼优化和匈牙利算法的D2D资源分配策略。在保证蜂窝用户以及D2D用户通信质量的前提下,该模型首先利用灰狼优化获得每个D2D用户的最佳发射功率,然后利用匈牙利算法实现D2D用户与蜂窝用户的最佳信道匹配,最大化D2D用户的总容量。仿真结果表明,该算法与和声搜索算法和遗传算法相比,在有效提升D2D用户的总容量同时,单个D2D用户也能获得较高的最大、最小容量。

关 键 词:D2D  灰狼优化  匈牙利算法  资源分配  车联网
收稿时间:2021/10/31 0:00:00
修稿时间:2022/4/20 0:00:00

D2D resource allocation strategy based on gray wolf optimizer and Hungarian algorithm
Xiao Yao,Liu Huiheng,Cheng Xiaohong,An Mangmang.D2D resource allocation strategy based on gray wolf optimizer and Hungarian algorithm[J].Application Research of Computers,2022,39(5):1529-1533.
Authors:Xiao Yao  Liu Huiheng  Cheng Xiaohong  An Mangmang
Affiliation:Hubei University of Arts and Science,,,
Abstract:At present, there are some problems in the Internet of Vehicles system, such as spectrum resources shortage, large system interference, and the communication quality of D2D users. To solve these problems, this paper proposed a D2D resource allocation strategy based on GWO-HA. On the premise of meeting the communication quality of cellular users and D2D users, this model used the gray wolf optimizer(GWO) to get the optimal transmission power of each D2D user. Then it realized the optimal channel matching between DUE and CUE by the Hungarian algorithm(HA) and obtained the maximum total capacity of D2D users. Simulation results show that, compared with harmony search(HS) and genetic algorithm(GA), the proposed algorithm can effectively improve the total capacity of D2D users. At the same time, single D2D user can also obtain high maximum and minimum capacities.
Keywords:D2D  grey wolf optimizer  Hungarian algorithm  resource allocation  Internet of Vehicles
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号