Stochastic soft backpressure algorithms for routing and scheduling in wireless ad-hoc networks

We develop a generalization of the backpressure (BP) algorithm to find routes and schedules in wireless ad-hoc networks. Different from BP that schedules links that maximize queue differentials, the proposed stochastic soft (SS)BP algorithm randomizes schedules across links and flows with significant queue differentials. We show that SSBP shares the fundamental property of BP, namely, that if given arrival rates can be supported by some routing-scheduling policy, they can be supported by SSBP. Simulations illustrate SSBP's improvement in delay performance.

[1]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[3]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[4]  Christian F. Tschudin,et al.  The gray zone problem in IEEE 802.11b based ad hoc networks , 2002, MOCO.

[5]  Xuan Kong,et al.  Adaptive Signal Processing Algorithms: Stability and Performance , 1994 .

[6]  Robert Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM 2004.

[7]  Nikos D. Sidiropoulos,et al.  Modelling and Optimization of Stochastic Routing for Wireless Multi-Hop Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.