基于VANET叫车系统的路由算法研究  

ON VANET-BASED ROUTING ALGORITHM FOR TAXI-CALLING SYSTEM

作　　者：李蓉[1] 宋飞[1] 张琳娟[1] 张宏科[1] 

机构地区：[1]北京交通大学电子信息工程学院,北京100044

出　　处：《计算机应用与软件》2015年第5期153-156,共4页Computer Applications and Software

基　　金：中央高校基本科研业务费专项资金项目(2014JBM010)

摘　　要：结合成熟的车载自组网技术和泛在的智能手持终端设备,提出一种去中心的动态叫车系统。乘客可以通过该系统随时发布叫车请求,并由车载自组网完成该请求的路由及车辆的匹配。同时,系统还提供了拼车功能,私家车也可通过该功能搭载顺路乘客。针对信息传输特点,重点研究一种基于效用值转发的路由算法,它根据车辆匹配成功概率计算效用值,并采用基于二分法的有限副本扩散策略,有效地避免信息盲目转发、减少网络负担。实验仿真结果表明,该系统的叫车成功率优于传统系统,基于效用的有限副本路由在网络开销、时延等方面均优于传统的传染路由和效用路由。Combining mature VANET technology and ubiquitous smart handset terminal devices, we propose a decentralised dynamic taxi- calling system. Passengers can issue calling requests via this system at anytime, and the route and the taxi matching of the requests are accomplished by VANET. Meanwhile, the carpooling function is provided as well by the system thus the private cars are able to take the passengers on their way through the function. Aiming at the features of information transmission, we mainly focus on studying a utility forwarding-based routing algorithm. It calculates the utility value based on the probability of successful matching of taxis, and employs dichotomisation-based limited-copy diffusion strategy to effectively avoid the blind forwarding and relieve the burden of network. Results of experimental simulation show that our system can perform better than the conventional taxi-calling systems in success rates. The utility-based limited-copy routing algorithm is superior to the conventional epidemic routing and utility routing in terms of network overhead and latency.

关 键 词：VANETS 叫车系统 合乘 效用路由 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]