Distributed Bandwidth Routing for Data Streaming across Multiple Routes for Improving Call Blocking Rate and Channel Utilization in Wireles Ad Hoc Networks

Abstract

In this paper, we propose a bandwidth-constrained routing algorithm to aggregate the bandwidth of multiple wireless links by splitting a data flow across multiple paths at the network layer. That is, it allows the packet flow of a source-destination pair to be delivered over multiple bandwidth routes with enough overall resources to satisfy a certain bandwidth requirement. Our algorithm considers not only the QoS requirement, but also the cost optimality of the routing paths to improve the overall network performance. We have analyzed the performance characteristics of the aggregation scheme and demonstrated significant gain when the links being aggregated have similar bandwidth and latency. Extensive simulations show that high call-admission ratio and resource utilization are achieved with modest routing overheads. This algorithm can also tolerate the node moving, joining, and leaving.