基于最大流的车辆容迟网络路由算法

Vehicle Delay-tolerant Network Routing Algorithm Based on Max Flow

为提高车辆容迟网络的吞吐率,将一对节点之间的数据传输过程视为最大流问题,提出基于最大流的车辆容迟网络路由算法。容迟网络中的最大流问题被转化为静态网络中的问题,从而可用最大流方案进行求解。实验结果证明,该算法的预测准确率高于传统算法,附带的额外开销较小。

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.