On the delay of a throughput optimal flow allocation scheme for random access WMNs

Abstract

In this paper we consider random access wireless mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate throughput optimal flow rate allocation with bounded delay guarantees for flows exhibiting both intra- and inter-path interference. In our prior work we have suggested a distributed flow allocation scheme that maximizes the average aggregate throughput of all flows also providing bounded delay guarantees. In this work we evaluate this scheme in terms of delay and compare its performance with the following schemes: a scheme that utilizes paths on a round-robin fashion, one that optimally utilizes the best path only and another one that assigns the maximum possible flow on each path. For the evaluation process Ns2 simulations of several random wireless scenarios are employed.