检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘文刚 陈玲玲[1] 黄福森 LIU Wen-gang;CHEN Ling-ling;HUANG Fu-sen(Jilin Institute of Chemical Technology,Jilin 132022,China)
机构地区:[1]吉林化工学院,吉林吉林132022
出 处:《电脑与电信》2024年第9期19-22,40,共5页Computer & Telecommunication
摘 要:针对现如今无线电频谱资源短缺,频谱利用率较低并且车辆用户有时参与频谱资源共享意愿较低的问题,在认知车联网(Cognitive Internet of Vehicles,CIoV)的环境中提出了一中基于双重拍卖算法(Double Auction,DA)来提高车辆与车辆(Vehicle to Vehicle,V2V)之间的频谱效率。具体利用双重拍卖算法建立一个频谱共享的频谱分配激励机制,并为授权车辆(PV)和认知车辆(SV)根据资源定价和资源需求建立排序队列,最后达到PV和SV双方满意的效果,提高车辆用户之间的频谱匹配效率与认知车联网系统的吞吐量。通过Python实验仿真结果表明,本文所提出的算法可以满足不同车辆条件下的满意度,并验证提出的双重拍卖算法比传统的先到先得拍卖算法的吞吐量有一定的提升。In response to the current problems of shortage of spectrum resources,low spectrum utilization rate and sometimes the lower willingness of the users to participate in spectrum resource sharing,this paper proposes a spectrum sharing method based on Double Auction algorithm(Double Auction,DA)in the cognitive internet of vehicles to improve efficient sharing of spectrum resources between Vehicle to Vehicle(V2V).The DA algorithm is used to establish a spectrum allocation incentive mechanism for spectrum sharing and establish a sorting queue for Priority Vehicles(PV)and Secondary Vehicles(SV)based on resource pricing and resource requirements.Finally,we can achieve satisfactory results for both parties and improve the throughput of the cognitive vehicle networking system.Through the Python experimental simulation results,the algorithm's satisfaction under different vehicle conditions is analyzed,and it is verified that the throughput of this algorithm is improved compared to the traditional firstcome-first-served auction algorithm.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222