Queue back-pressure random access in multihop wireless networks: Optimality and stability

Jiaping Liu, Alexander L. Stolyar, Mung Chiang, H. Vincent Poor

Research output: Contribution to journalArticlepeer-review

38 Scopus citations


A model for wireless networks with slotted-Aloha-type random access and with multihop 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.

Original languageEnglish (US)
Pages (from-to)4087-4098
Number of pages12
JournalIEEE Transactions on Information Theory
Issue number9
StatePublished - 2009

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Aloha
  • Distributed algorithm
  • Queue back-pressure
  • Random access
  • Stability
  • Throughput region


Dive into the research topics of 'Queue back-pressure random access in multihop wireless networks: Optimality and stability'. Together they form a unique fingerprint.

Cite this