We consider a model of wireless network with random (slotted-Aloha-type) access and with multi-hop flow routes. The goal is to devise distributed strategies for optimal utility-based end-to-end throughput allocation and queueing stability. We consider a class of queue back-pressure randomaccess algorithms (QBRA), where actual queue lengths of the flows (in each node’s close neighborhood) are used to determine nodes’ channel access probabilities. This is in contrast to previously proposed algorithms, which are purely optimizationbased and oblivious of actual queues. QBRA is also substantially different from much studied “MaxWeight” type scheduling algorithms, also using back-pressure. For the model with infinite backlog at each flow source, we show 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 a random access. (No end-to-end message passing is required.) This scheme generalizes for the case of additional, minimum flow rate constraints. For the model with stochastic exogenous arrivals, we show 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 (queue oblivious) optimization-based random access algorithms, shows that QBRA performs better in terms of endto-end delays.
[1]
Leandros Tassiulas,et al.
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
,
1992
.
[2]
A. Robert Calderbank,et al.
Jointly optimal congestion and contention control based on network utility maximization
,
2006,
IEEE Communications Letters.
[3]
Vaduvur Bharghavan,et al.
Achieving MAC layer fairness in wireless packet networks
,
2000,
MobiCom '00.
[4]
P. Gupta,et al.
Optimal Throughput Allocation in General Random-Access Networks
,
2006,
2006 40th Annual Conference on Information Sciences and Systems.
[5]
A. Robert Calderbank,et al.
Utility-optimal random-access control
,
2007,
IEEE Transactions on Wireless Communications.
[6]
Norman M. Abramson,et al.
THE ALOHA SYSTEM: another alternative for computer communications
,
1899,
AFIPS '70 (Fall).
[7]
Alexander L. Stolyar.
Dynamic Distributed Scheduling in Random Access Networks
,
2005
.
[8]
Koushik Kar,et al.
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access
,
2005,
MobiHoc '05.