Back-pressure routing and optimal scheduling in wireless broadcast networks

Authors:
Qiao Li;Rohit Negi
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 5
Cited 0

A high-throughput path metric for multi-hop wireless routing

Proceedings of the 9th annual international conference on Mobile computing and networking
Dynamic power allocation and routing for satellite and wireless networks with time varying channels

Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Optimal backpressure routing for wireless networks with multi-receiver diversity

Ad Hoc Networks
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the joint routing and scheduling problem in wireless networks with lossy channels. In order to combat channel loss, packets are assumed to be transmitted by nodes using broadcast, instead of traditional point-to-point communication. We first analyze the network capacity region, and then propose a back-pressure routing with max-weight scheduling algorithm to achieve it. The proposed algorithm is a generalization of the algorithm proposed by Tassiulas [1] to wireless broadcast networks. Further, we propose a random low complexity scheduling algorithm which, combined with backpressure routing, also achieves the same capacity region. Both stability results are proved by the method of fluid limits [2].