一种基于最小费用最大流理论的Ad hoc路由协议

A Minimum Cost and Maximum Flow Based Ad hoc Network Routing Protocol

针对Ad hoc网络QoS路由问题,提出了一种基于最小费用最大流理论的Ad hoc路由协议(MCMFP)。将Ad hoc的移动终端作为网络节点,通信链路作为相邻节点之间的边,建立了Ad hoc网络的网络流模型,使Ad hoc网络的路由计算问题转化为图论中的最小费用最大流问题,从而计算出满足多QoS约束的路由路径,优化了网络带宽的使用,提高了通信信道的利用率,实现了网络流量的负载均衡。仿真结果表明,MCMFP协议具有更高的包转发率和更小的平均时延,有效提高了Adhoc网络的QoS性能。

Foused on the Qos Routing problem in Ad hoc network, the Minimum cost and Maximum flow based routing protocol（MCMFP） is presented. In MCMFP, the network flows model of Ad hoc was established, with Ad hoc mobile terminals as the network nodes, and communication links as the edges between adjacent nodes. So the QoS problem has been transformed into the cost of the network flows, and multi-constraint QoS routing have been ensured. MCMF effectively optimized the bandwidth and improved the utilization of communication channels, and a certain degree of traffic load balancing has achieved. Simulation shows MCMFP has high packet forward rate and low average end to end delay, and the QoS performance of Ad hoc network has been improved.