一种车联网分簇算法研究  

Research on a Clustering Algorithm for Internet of Vehicles

作　　者：曾萍[1] 赵耿[1] 张沥文 ZENG Ping;ZHAO Geng;ZHANG Liwen(Beijing Electronic Science and Technology Institute,Beijing 100070,P.R.China)

机构地区：[1]北京电子科技学院,北京市100070

出　　处：《北京电子科技学院学报》2022年第3期100-110,共11页Journal of Beijing Electronic Science And Technology Institute

基　　金：北京高校“高精尖”学科建设项目(项目编号:3201017);国家自然科学基金项目(项目编号:61772047)。

摘　　要：在现有的车对车(Vehicle-to-vehicle,V2V)通信中,由路边单元(Road Side Unit,RSU)实现局部道路区域内车辆的分簇通信无法满足全局分簇通信的稳定性和局部区域快速分簇的要求。为解决上述两个问题,本文提出了一种基于平均链路依赖度的软件定义车联网分簇算法,并依据该算法设计、实现了车辆节点加入/离开簇、簇内以及簇间的通信协议,最后对方案进行了性能分析。与现有算法相比,该算法的平均簇头持续时间在城市道路和高速公路两种场景分别提升了44%和68%。In existing vehicle-to-vehicle(V2 V)communications,clustering communication of vehicles in local road area realized by the road side unit(RSU)could not satisfy the demand on the stability of global clustering communication and the demand on the clustering speed in local area.To address the two problems,a software-defined clustering algorithm for Internet of vehicles based on average link dependence is proposed in this paper.According to the algorithm,the communication protocols for the vehicle nodes joining and leaving the clusters,within-clusters,and inter-clusters are designed and implemented.Finally,the performance of the scheme is analyzed.Compared with existing algorithms,average cluster head duration of the proposed algorithm increases by 44%and 68%in urban road and expressway scenarios,respectively.

关 键 词：软件定义网络 车联网 分簇算法 簇头选择 簇维护 

分 类 号：TN918[电子电信—通信与信息系统] TN393[电子电信—信息与通信工程]