首页> 外文期刊>Wireless communications & mobile computing >A Two-Level Communication Routing Algorithm Based on Vehicle Attribute Information for Vehicular Ad Hoc Network
【24h】

A Two-Level Communication Routing Algorithm Based on Vehicle Attribute Information for Vehicular Ad Hoc Network

机译:一种基于车辆属性信息的二级通信路由算法,用于车辆临时网络

获取原文
           

摘要

Recently, the research on the vehicular ad hoc network (VANET) has been paid more attention by researchers with the quick development of the autonomous driving technology. In the VANET, vehicles can communicate with everything through the route established by routing algorithms. However, the topology of the VANET changes fast because the vehicles move fast. Also, as the number of vehicles increases, the probability of data collision and the transmission latency will also increase when communicating. Therefore, the VANET needs a stable, low-latency, and efficient route for vehicles to communicate with each other. However, the existing routing algorithms are either unable to aggregate data or are not suitable for the large-size VANET. In this paper, we consider the vehicle attribute information comprehensively and cluster the vehicles on the road by using the cluster algorithm we propose. We dynamically select the cluster heads at each moment according to their attribute information. We consider all kinds of nodes in the network and the vehicle nodes will communicate with each other through the cluster heads under the two-level communicating algorithm we propose. Compared with the existing cluster routing algorithm, the algorithm we propose is much more suitable for the large-size VANET because the cluster heads do not need a gateway to help them communicate. In the simulation part, we set some real street scenes in Simulation of Urban Mobility (SUMO) and the vehicles can move by the traffic rules like in the real world, which is more suitable for the VANET. After analysing the communication performance in Network Simulator version 2 (NS2), we can get a conclusion that the algorithm proposed is superior to the traditional routing algorithm. The route established by the algorithm we propose is much more stable and efficient. And the latency is also lower than the former.
机译:最近,对车辆临时网络(VANET)的研究得到了研究人员在自主驾驶技术的快速发展中得到了更多的关注。在Vare中,车辆可以通过路由算法建立的路线与所有内容通信。然而,Vanet的拓扑变化得很快,因为车辆快速移动。而且,随着车辆的数量增加,数据冲突和传输延迟的概率也将在通信时增加。因此,Vanet需要稳定,低延迟和高效的车辆彼此通信。但是,现有的路由算法无法汇总数据或不适合大尺寸VANET。在本文中,我们通过使用我们提出的集群算法全面地全面地进行车辆属性信息,并将车辆集成道路上的车辆。我们根据其属性信息动态地选择每个时刻的群集头。我们考虑网络中的各种节点,并且车辆节点将通过我们提出的两级通信算法下通过簇头互相通信。与现有的集群路由算法相比,我们提出的算法更适合大尺寸VANET,因为群集头不需要网关来帮助它们进行通信。在模拟部分中,我们在城市移动性(SUMO)的仿真中设置了一些真正的街景场,并且车辆可以通过现实世界中的交通规则移动,这更适合Vanet。在网络模拟器版本2中的通信性能(NS2)中分析后,我们可以得出结论,所提出的算法优于传统的路由算法。我们提出的算法建立的路线更稳定和有效。并且延迟也低于前者。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号