计算机工程2011，Vol.37Issue(21)：80-82,85,4.DOI:10.3969/j.issn.1000-3428.2011.21.027
基于最大流的车辆容迟网络路由算法
Vehicle Delay-tolerant Network Routing Algorithm Based on Max Flow
摘要
Abstract
In order to improve Vchicular Ad Hoc Network(VANET) routing performance, cspecially in the whole network throughput, this paper presents a VANET routing algorithm based on max flow. Each transmission between a pair of source and destination can be taken as a max flow problem. With the method, a Delay-toleranl Network(DTN) max flow problem can be easily converted to a static network problem, and be solved by traditional algorithms. Simulation shows that the solution can perform a better throughput than some exiled algorithms with small overhead.关键词
容迟网络/车载自组网/运动模型/车辆运动模式/最大流Key words
Delay-tolerant Network(DTN)/Vehicular Ad Hoc Nelwork(VANET)/mobility model: Vehicle Mobility Pattern(VMP)/max flow分类
信息技术与安全科学引用本文复制引用
李天南,薛广涛..基于最大流的车辆容迟网络路由算法[J].计算机工程,2011,37(21):80-82,85,4.基金项目
国家自然科学基金资助项目(60970106,60673166) （60970106,60673166）
