Performance of wireless Ad Hoc networks under balanced fairness

Abstract

Balanced fairness is a new resource sharing concept recently introduced by Bonald and Proutière. We extend the use of this notion to wireless networks where the link capacities at the flow level are not fixed but depend on the scheduling of transmission rights to interfering nodes on a faster time scale. The balance requirement together with the requirement of maximal use of the network's resources jointly determine both a unique state-dependent scheduling and bandwidth sharing between the contending flows. The flow level performance under the resulting scheme is insensitive to detailed traffic characteristics, e.g., flow size distribution. The theoretical and computational framework is formulated and illustrated by two examples for which the performance in terms of average flow throughputs in a dynamic system is explicitly worked out. © IFIP International Federation for Information Processing 2004.