摘要: 为提高车辆容迟网络的吞吐率,将一对节点之间的数据传输过程视为最大流问题,提出基于最大流的车辆容迟网络路由算法。容迟网络中的最大流问题被转化为静态网络中的问题,从而可用最大流方案进行求解。实验结果证明,该算法的预测准确率高于传统算法,附带的额外开销较小。
关键词:
容迟网络,
车载自组网,
运动模型,
车辆运动模式,
最大流
Abstract: In order to improve Vehicular Ad Hoc Network(VANET) routing performance, especially 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-tolerant 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 exited algorithms with small overhead.
Key words:
Delay-tolerant Network(DTN),
Vehicular Ad Hoc Network(VANET),
mobility model,
Vehicle Mobility Pattern(VMP),
max flow
中图分类号:
李天南, 薛广涛. 基于最大流的车辆容迟网络路由算法[J]. 计算机工程, 2011, 37(21): 80-82,85.
LI Tian-Na, XUE An-Chao. Vehicle Delay-tolerant Network Routing Algorithm Based on Max Flow[J]. Computer Engineering, 2011, 37(21): 80-82,85.