2随机时延约束低代价组播路由算法.doc

CVI中基于随机时延约束的低代价组播路由算法* 张龙1，张欣欣1，黄伟2，许海涛3 (1.河北工程大学 Join分组后为避免同时进行回复而增加节点间的碰撞，提出了随机时延策略。利用节点间路径共享的方法构建满足随机时延约束的最小代价初始树，将不满足随机时延约束的车辆节点用最小时延路径代替。仿真结果表明，与其他算法相比，该算法降低了构建组播树所需的平均时间和代价，提高了数据传输能力。 关键词: 车路协同；组播树；随机时延；代价 中图分类号: TP393.02　　 文献标志码: A 文章编号：（作者可不填） Low-cost Multicast Routing Algorithm Based on CVI Random Delay-constrained ZHANG Long1 ZHANG Xin-xin1 HUANG Wei2 XU Hai-tao3 （1 School of Information and Electrical Engineering, Hebei University of Engineering, Handan 056038,China?；2 Energy Efficiency Evaluation Center, China Electric Power Research Institute, Beijing 100192，China3 School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083,China） According?to the?problem?of?multicast?data?transmission?under?the?Cooperative Vehicle Infrastruct- ure?environment. A low-cost multicast routing algorithm based on random delay-constrained is proposed. When purpose vehicle node receiving the Join group to avoid simultaneously reply and increase the possibility of collision, start the strategy of Random Delay-constrained, and the same time Using the method of path shared between nodes to structure the minimum cost initial tree that meet the random time delay, the node that cannot meet the constraint of random time delay will be replaced by the minimum time delay path.. Simulation results show that the proposed algorithm has less computation time and low cost compared with other algorithm. so is better for vehicles to send real-time business processing and transmission capacity, suitable for the reality of the network. Key words: Cooperative Vehicle Infrastructure; multicast tree; random delay; cost 引言 车路协同（Cooperative Vehiclefrastructure, CVI）是车联网发展的高级阶段，主要利用无线通信和传感探测等技术全方位的获得道路网络上车辆的运行状态信息，通过车载单元路侧单元和出行者之间的实时、高效和双向的信息交互，实现车辆和车辆、车辆和和基础设施之间的智能协同与配合，为提供全时空的、可靠的交通信息，从而有效的提升道路交通安全和通行效率，达到优化利用系统资源、缓解交通拥堵的目标[1]。 组播从一个源车辆节点发送组播数据包到所有组播成员的一种点到多点的数据传输方式[]。在车路协同环境中当有多个车辆节点进行实时数据传输时，利用组播任何一个链路只转发单