Queue Back-Pressure Random Access in Multi-Hop Wireless Networks: Optimality and Stability

Free registration required

Executive Summary

A model for wireless networks with slotted-Aloha-type random access and with multi-hop flow routes is considered. The goal is to devise distributed algorithms for utility-optimal end-to-end throughput allocation and queueing stability. A class of Queue Back-pressure Random access Algorithms (QBRAs), in which actual queue lengths of the flows in each node's close neighborhood are used to determine the nodes' channel access probabilities, is studied. This is in contrast to some previously proposed algorithms, which are based on deterministic optimization formulations and are oblivious to actual queues. QBRA is also substantially different from the well studied "MaxWeight" type scheduling algorithms, even though both use the concept of back-pressure.

  • Format: PDF
  • Size: 923.7 KB