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

Authors:
Jiaping Liu;Alexander L. Stolyar;Mung Chiang;H. Vincent Poor
Affiliations:
Department of Electrical Engineering, Princeton University, Princeton, NJ;Bell Labs, Alcatel-Lucent, Murray Hill, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 7
Cited 4

Achieving MAC layer fairness in wireless packet networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Distributed link scheduling with constant overhead

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
THE ALOHA SYSTEM: another alternative for computer communications

AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Utility-optimal random access: reduced complexity, fast convergence, and robust performance

IEEE Transactions on Wireless Communications
Utility-Optimal Random-Access Control

IEEE Transactions on Wireless Communications

Routing without routes: the backpressure collection protocol

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Implementing utility-optimal CSMA

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Backoff mechanisms in narrow band and spread spectrum aloha networks

Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
Delay-based back-pressure scheduling in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	754.84

Visualization

Abstract

A model for wireless networks with slotted-Alohatype 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. For the model with infinite backlog at each flow source, it is shown that QBRA, combined with simple congestion control local to each source, leads to optimal end-to-end throughput allocation within the network saturation throughput region achievable by random access, without end-to-end message passing. This scheme is generalized to the case with minimum flow rate constraints. For the model with stochastic exogenous arrivals, it is shown that QBRA ensures stability of the queues as long as nominal loads of the nodes are within the saturation throughput region. Simulation comparison of QBRA and the queue oblivious random-access algorithms, shows that QBRA reduces end-to-end delays.