论文标题
车辆临时网络的稳定动态预测聚类(SDPC)协议
Stable Dynamic Predictive Clustering (SDPC) Protocol for Vehicular Ad hoc Network
论文作者
论文摘要
车辆通信是智慧城市的重要组成部分。当车辆数量在任何特定点增加时,可伸缩性是车辆通信的主要问题。车辆还遇到了其他一些问题,例如广播问题。聚类可以解决车辆临时网络(VANET)的问题;但是,由于车辆的流动性很高,Vanet中的聚类遇到了稳定性问题。先前提出的VANET聚类算法已针对直路或交叉路口进行了优化。此外,没有智能使用移动性参数的组合,例如方向,移动,位置,速度,车辆程度,交叉路口等等,从而导致集群稳定性问题。考虑到所有移动性参数的有效使用可以解决VANET中的稳定性问题,一种动态聚类算法。为了实现Vanet的较高稳定性,本文提出了一种新型的鲁棒和动态聚类算法稳定的动态预测聚类(SDPC)。与以前的研究相比,在创建集群时,考虑了车辆相对速度,车辆位置,车辆距离,变速箱范围和车辆密度,而相对距离,交叉路口的移动,车辆的程度被认为是选择群集头。从移动性参数中构建了未来的道路场景。创建了集群,并根据未来的道路建设来选择簇头。比较SDPC的性能,以平均群集头的变化率,平均聚类头持续时间,平均群集成员持续时间以及群集开销的比率在总数据包传输方面。仿真结果显示SDPC的表现优于现有算法,并实现了更好的聚类稳定性。
Vehicular communication is an essential part of a smart city. Scalability is a major issue for vehicular communication, specially, when the number of vehicles increases at any given point. Vehicles also suffer some other problems such as broadcast problem. Clustering can solve the issues of vehicular ad hoc network (VANET); however, due to the high mobility of the vehicles, clustering in VANET suffers stability issue. Previously proposed clustering algorithms for VANET are optimized for either straight road or for intersection. Moreover, the absence of the intelligent use of a combination of the mobility parameters, such as direction, movement, position, velocity, degree of vehicle, movement at the intersection etc., results in cluster stability issues. A dynamic clustering algorithm considering the efficient use of all the mobility parameters can solve the stability problem in VANET. To achieve higher stability for VANET, a novel robust and dynamic clustering algorithm stable dynamic predictive clustering (SDPC) for VANET is proposed in this paper. In contrast to previous studies, vehicle relative velocity, vehicle position, vehicle distance, transmission range, and vehicle density are considered in the creation of a cluster, whereas relative distance, movement at the intersection, degree of vehicles are considered to select the cluster head. From the mobility parameters the future road scenario is constructed. The cluster is created, and the cluster head is selected based on the future construction of the road. The performance of SDPC is compared in terms of the average cluster head change rate, the average cluster head duration, the average cluster member duration, and the ratio of clustering overhead in terms of total packet transmission. The simulation result shows SDPC outperforms the existing algorithms and achieved better clustering stability.