[1]陈清秋,朱 琦.VANET 中基于车辆分簇的协作缓存策略[J].计算机技术与发展,2022,32(11):214-220.[doi:10. 3969 / j. issn. 1673-629X. 2022. 11. 032]
　CHEN Qing-qiu,ZHU Qi.Cooperative Caching Strategy Based on Vehicle Clustering in VANET[J].,2022,32(11):214-220.[doi:10. 3969 / j. issn. 1673-629X. 2022. 11. 032]
点击复制

VANET 中基于车辆分簇的协作缓存策略()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
32
期数:
2022年11期
页码:
214-220
栏目:
新型计算应用系统
出版日期:
2022-11-10

文章信息/Info

Title:
Cooperative Caching Strategy Based on Vehicle Clustering in VANET
文章编号:
1673-629X(2022)11-0214-07
作者:
陈清秋; 朱 琦
南京邮电大学 江苏省无线通信重点实验室,江苏 南京 210003
Author(s):
CHEN Qing-qiu; ZHU Qi
Key Lab of Wireless Communications of Jiangsu Province,Nanjing University of Posts and Telecommunications,Nanjing 210003,China
关键词:
车载自组织网络; 车辆分簇; 协作边缘缓存; 缓存放置; 蚁群算法
Keywords:
VANET; vehicle clustering; cooperative edge caching; cache placement; ant colony algorithm
分类号:
TP393
DOI:
10. 3969 / j. issn. 1673-629X. 2022. 11. 032
摘要:
随着智能交通系统的发展,移动车辆不仅需要地图信息,还需要更多娱乐内容,而整个网络的容量是有限的,这给车载自组织网络带来很大的压力。 边缘缓存是在系统的边缘部署缓存,在车载自组织网络中引入边缘缓存技术,可以有效地缓解网络的压力。 对车载自组织网络中的缓存策略进行了研究,提出了一种基于车辆分簇的协作边缘缓存策略,可以充分利用车载自组织网络中有限的缓存资源,内容可以缓存在移动车辆和路边单元中,移动车辆可以从簇头和路边单元获取所需内容,不同的内容获取方式会带来不同的请求时延。 由于移动车辆和路边单元的缓存容量是有限的,为了降低内容请求时延和成本,构建了一个时延和成本联合最小化的优化问题,并采用蚁群算法对该问题进行求解,以得到最优的缓存放置方案。 仿真结果表明,该算法拥有很好的性能。
Abstract:
With the development of intelligent transportation system,mobile vehicles will need not only map information,but also moreentertainment content,but the capacity of the entire network is limited,which brings great pressure to the vehicular ad hoc network ( VANET) . Edge caching is the deployment of caches on the edge of the system,introducing edge caching into VANET? can effectively relievethe pressure of the network. A collaborative edge caching strategy based on vehicle clustering is proposed,which can make full use of thelimited caching resources? ? ? ?in VANET, contents can be cached in mobile vehicles and roadside unit ( RSU) , mobile vehicles can getrequested contents from cluster head and roadside unit, and different ways to get contents will bring different delay. Considering thelimited cache capacity of moving vehicles and roadside unit,an optimization problem is constructed to minimize the delay and cost and solved by the ant colony algorithm to obtain the optimal cache placement scheme. The simulation shows that the proposed algorithm is efficient.

相似文献/References:

[1]于明鹭[],刘南杰[][],赵海涛[][]. 车载网中紧急消息的广播性能分析[J].计算机技术与发展,2015,25(12):169.
　YU Ming-lu[],LIU Nan-jie[][],ZHAO Hai-tao[][]. Performance Analysis of Emergency Message Broadcast in Vehicular Ad Hoc Networks[J].,2015,25(11):169.
[2]于明鹭[],刘南杰[][],赵海涛[][]. 车载网中基于分段与协作的MAC协议[J].计算机技术与发展,2016,26(03):80.
　YU Ming-lu[],LIU Nan-jie[][],ZHAO Hai-tao[][]. Segmentation and Cooperation Based Media Access Control Protocol in VANETs[J].,2016,26(11):80.
[3]周鹏,肖晓强,宁伟勋. 基于车辆轨迹社会属性的VANETs路由算法[J].计算机技术与发展,2017,27(11):28.
　ZHOU Peng,XIAO Xiao-qiang,NING Wei-xun. A VANETs Routing Algorithm Based on Trace Data’ s Social Attribute[J].,2017,27(11):28.
[4]张文都乔雅.车载自组织网络下车辆移动模型仿真测试研究[J].计算机技术与发展,2018,28(11):188.[doi:10.3969/j.issn.1673-629X.2018.11.041]
　ZHANG Wen-du,QIAO Ya.Research on Vehicular Mobility Model Simulation Test in VANETs[J].,2018,28(11):188.[doi:10.3969/j.issn.1673-629X.2018.11.041]
[5]李炳圻,梅中辉.一种适用于城市环境的VANET成簇算法[J].计算机技术与发展,2019,29(01):154.[doi:10. 3969 / j. issn. 1673-629X. 2019. 01. 032]
　LI Bing-qi,MEI Zhong-hui.A Stable Clustering Algorithm Applied in VANETs onUrban Road Environment[J].,2019,29(11):154.[doi:10. 3969 / j. issn. 1673-629X. 2019. 01. 032]
[6]汤媛媛,朱琦,胡晗.基于内容及留存时间的VANETs转发策略[J].计算机技术与发展,2019,29(04):116.[doi:10. 3969 / j. issn. 1673-629X. 2019. 04. 024]
　TANG Yuan-yuan,ZHU Qi,HU Han.A VANETs Forwarding Strategy Based on Content and Retention Time[J].,2019,29(11):116.[doi:10. 3969 / j. issn. 1673-629X. 2019. 04. 024]
[7]路 婷,王 伟.基于遗传特征的车载网络分簇路由算法研究[J].计算机技术与发展,2021,31(09):13.[doi:10. 3969 / j. issn. 1673-629X. 2021. 09. 003]
　LU Ting,WANG Wei.Research on Clustering Routing Algorithm in Vehicle Network Based on Genetic Features[J].,2021,31(11):13.[doi:10. 3969 / j. issn. 1673-629X. 2021. 09. 003]

更新日期/Last Update: 2022-11-10