Distributed CSMA algorithms for link scheduling in multihop MIMO networks under SINR model

Authors:
Dajun Qian;Dong Zheng;Junshan Zhang;Ness B. Shroff;Changhee Joo
Affiliations:
School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ;Broadcom Corporation, Sunnyvale, CA;School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ;Departments of Electrical and Computer Engineering and Computer Science and Engineering, The Ohio State University, Columbus, OH;School of Electrical and Computer Engineering, Ulsan National Institute of Science and Technology, Ulsan , Korea
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 13
Cited 0

On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas

Wireless Personal Communications: An International Journal
Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Characterization and analysis of multi-hop wireless MIMO network throughput

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model

INFOCOM'10 Proceedings of the 29th conference on Information communications
A distributed CSMA algorithm for throughput and utility maximization in wireless networks

IEEE/ACM Transactions on Networking (TON)
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions

IEEE/ACM Transactions on Networking (TON)
Local Greedy Approximation for Scheduling in Multihop Wireless Networks

IEEE Transactions on Mobile Computing
On the capacity of multiuser MIMO networks with interference

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

IEEE Transactions on Information Theory
Multiple-antenna capacity in the low-power regime

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study distributed scheduling in multihop multiple-input-multiple-output (MIMO) networks. We first develop a "MIMO-pipe" model that provides the upper layers a set of rates and signal-to-interference-plus-noise ratio (SINR) requirements that capture the rate-reliability tradeoff in MIMO communications. The main thrust of this paper is then dedicated to developing distributed carrier sense multiple access (CSMA) algorithms for MIMO-pipe scheduling under the SINR interference model. We choose the SINR model over the extensively studied protocol-based interference models because it more naturally captures the impact of interference in wireless networks. The coupling among the links caused by the interference under the SINR model makes the problem of devising distributed scheduling algorithms very challenging. To that end, we explore the CSMA algorithms for MIMO-pipe scheduling from two perspectives. We start with an idealized continuous-time CSMA network, where control messages can be exchanged in a collision-free manner, and devise a CSMA-based link scheduling algorithm that can achieve throughput optimality under the SINR model. Next, we consider a discrete-time CSMA network, where the message exchanges suffer from collisions. For this more challenging case, we develop a "conservative" scheduling algorithm by imposing a more stringent SINR constraint on the MIMO-pipe model. We show that the proposed conservative scheduling achieves an efficiency ratio bounded from below.