车联网中基于组合权重的广播路由算法OA
A combinatorial weight-based broadcast routing algorithm for vehicle-to-vehicle communication
随着物联网和智能交通系统的发展而出现的车辆自组织网络,容易因车辆的高移动性而导致拥塞和链路不稳定,在车辆之间引入高效的路由技术可以减少延迟,提高可靠性.由于车辆节点的高速移动会导致网络拓扑结构的快速变化,所以在选择路线权重因素时,不仅要考虑车辆的位置和速度,还要考虑车辆间距离、运动方向等众多参数.针对路由选择效率低和链路不稳定的问题,提出了一种基于组合权重的广播路由选择算法.算法在从源节点到目的节点所建立的路径中,在车辆间距离、车辆相对于水平正方向的角度、链路通断率、车流密度的4 个权重因素组合下选择出最优路径.仿真结果表明,与 LSPR 算法相比,本文所提 TPWR 算法的数据传输速率和链路生存时间分别提高了25.12%和17.68%.
Vehicle AD hoc Networks(VANETs),which have emerged with the development of the Inter-net of Things(IoT)and Intelligent Transportation Systems(ITS),are prone to network congestion and link instability due to the high mobility of vehicles.Introducing efficient routing technology between vehi-cles can reduce latency and enhance reliability.Since the high-speed movement of vehicle nodes can lead to rapid changes in the network topology,multiple parameters such as the position and speed of the vehi-cles,inter-vehicle distance and the direction of movement must be considered when choosing route weight factors.Aiming at the problems of low routing selection efficiency and unstable links,a broadcast routing selection algorithm based on combined weights is proposed.The algorithm selects the optimal path from the route established from the source node to the destination node based on the combination of four weigh-ting factors:inter-vehicle distance,angle of vehicles relative to the horizontal direction,link interruption rate,and traffic density.Simulation results show that,compared with the LSPR algorithm,the proposed TPWR algorithm increases the data transmission rate by 25.12%and the link lifetime by 17.68%.
孙潇;孙鉴;肖增辉
山东理工大学 计算机科学与技术学院,山东 淄博 255049山东理工大学 电气与电子工程学院,山东 淄博 255049山东理工大学 计算机科学与技术学院,山东 淄博 255049
通用工业技术
车联网广播遍历组合权重路由路由变化度
vehicle-to-vehicle communicationbroadcast traversalcombinatorial weight routingroute change degree
《山东理工大学学报(自然科学版)》 2026 (5)
22-28,7
山东省自然科学基金项目(ZR2023MF111)
评论