A DISTRIBUTED ALGORITHM FOR CONGESTION-MINIMIZED MULTI-PATH ROUTING OVER AD HOC NETWORKS (WedAmPO1)

Author(s) : Xiaoqing Zhu (Stanford University, United States of America) Bernd Girod (Stanford University, United States of America)

Abstract : To support high rate multimedia streams over an ad hoc network with limited link capacities, multi-path routing is needed to achieve a higher aggregated bandwidth. For streaming applications with a latency constraint, it is also important to minimize the network congestion to avoid excessive delay. We propose a distributed algorithm to achieve congestion-minimized multi-path routing. The optimal solution can be approximated by decomposing the total target rate into a sequence of rate increments, and using the classical Bellman-Ford algorithm to find a corresponding minimum-cost route for each increment. Simulation results for video streaming over an ad hoc network show that compared to a centralized scheme, the approximations introduced by the distributed algorithm lead to degradation of less than 0.5dB in PSNR of received video quality.

Menu