CAJ | 학술논문

车载网络WAVE中车与车之间能够通信靠的是移动过程中车与车之间建立起来的网络连接，路由是实现网络连接的一个关键问题。基于行车速度与距离的快速多跳路由算法FMHR是以中间车辆与目标车辆之间通信时间值最小为策略来选择信息传递的下一跳。提出的保持最大通信时间KMCT路由算法与FMHR不同，KMCT 是以中间车辆与发送信息车辆之间通信时间的最大值为策略来选择信息传递的下一跳，实验结果表明，当车辆速度较高时，KMCT性能要优于FMHR。
차재망락WAVE중차여차지간능구통신고적시이동과정중차여차지간건립기래적망락련접，로유시실현망락련접적일개관건문제。기우행차속도여거리적쾌속다도로유산법FMHR시이중간차량여목표차량지간통신시간치최소위책략래선택신식전체적하일도。제출적보지최대통신시간KMCT로유산법여FMHR불동，KMCT 시이중간차량여발송신식차량지간통신시간적최대치위책략래선택신식전체적하일도，실험결과표명，당차량속도교고시，KMCT성능요우우FMHR。
The communication of between the vehicles in vehile-born network relies on the large network connection established between the mobile vehicles. Here route is the key to connecting the network. Fast multi-hop routing algorithm based on traffic speed and distance selects the next vehicle hop to transmit information in accordance with minimum time between middle vehicle and target vehicle. The algorithm proposed in this paper, is different from FMHR in KMCT (Keeping Max Communication Time). KMCT picks the next vehicle hop in accordance with minimum time between middle vehicle and source vehicle. The experimental results show that KMCT algorithm outperforms FMHR when the vehicle speed is fairly high.