CAJ | 학술논문

协助下载进行的大量数据交换导致了频繁的传输冲突，已有信道争用方式不适用于拓扑变化频繁的车联网。为解决该问题，提出一种车联网协助下载传输规划方法。根据协助下载的路由数量建立一个 k 级约束路由树，根据树中每个节点传输的数据量为其规划传输时间片。该方法的目标是在避免冲突的前提下尽可能多的转发数据。仿真结果表明，使用该方法可以使用户获取的数据包增加30％，有效提高了系统的吞吐量。
협조하재진행적대량수거교환도치료빈번적전수충돌，이유신도쟁용방식불괄용우탁복변화빈번적차련망。위해결해문제，제출일충차련망협조하재전수규화방법。근거협조하재적로유수량건립일개 k 급약속로유수，근거수중매개절점전수적수거량위기규화전수시간편。해방법적목표시재피면충돌적전제하진가능다적전발수거。방진결과표명，사용해방법가이사용호획취적수거포증가30％，유효제고료계통적탄토량。
Data exchange causes frequent collision among cooperative vehicles and the client.To solve the problem,a transmis-sion scheduling method was proposed.Firstly,a k-constraint routing tree was built according to the amount of linked routes,and then the time transmitted for every node in the tree was scheduled.The goal of the method is to forward data as soon as possible on the premise of collision free.Simulation results indicate the benefits of the proposed scheme in terms of increasing efficiency and reducing delay.