CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model

Dajun Qian, Dong Zheng, Junshan Zhang, Ness Shroff

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)

Abstract

We study the problem of distributed scheduling in multi-hop MIMO networks. We first develop a "MIMO-pipe" model that provides the upper layers a set of rates and SINR requirements, which capture the rate-reliability tradeoff in MIMO communications. The main thrust of this study is then dedicated to developing CSMA-based MIMO-pipe scheduling under the SINR model. We choose the SINR model over the extensively studied matching or 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 makes the problem of devising distributed scheduling algorithms particularly challenging. To that end, we explore CSMA-based MIMO-pipe scheduling, from two perspectives. First, we consider an idealized continuous time CSMA network. We propose a dual-band approach in which control messages are exchanged instantaneously over a channel separate from the data channel, and show that CSMA-based scheduling can achieve throughput optimality under the SINR model. Next, we consider a discrete time CSMA network. To tackle the challenge due to the coupling caused by interference, we propose a "conservative" scheduling algorithm in which more stringent SINR constraints are imposed based on the MIMO-pipe model. We show that this suboptimal distributed scheduling can achieve an efficiency ratio bounded from below.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
DOIs
StatePublished - 2010
EventIEEE INFOCOM 2010 - San Diego, CA, United States
Duration: Mar 14 2010Mar 19 2010

Other

OtherIEEE INFOCOM 2010
CountryUnited States
CitySan Diego, CA
Period3/14/103/19/10

Fingerprint

Carrier sense multiple access
MIMO systems
Scheduling
Pipe
Scheduling algorithms
Parallel algorithms
Wireless networks
Throughput
Network protocols
Communication

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model. / Qian, Dajun; Zheng, Dong; Zhang, Junshan; Shroff, Ness.

Proceedings - IEEE INFOCOM. 2010. 5462119.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Qian, D, Zheng, D, Zhang, J & Shroff, N 2010, CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model. in Proceedings - IEEE INFOCOM., 5462119, IEEE INFOCOM 2010, San Diego, CA, United States, 3/14/10. https://doi.org/10.1109/INFCOM.2010.5462119
Qian, Dajun ; Zheng, Dong ; Zhang, Junshan ; Shroff, Ness. / CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model. Proceedings - IEEE INFOCOM. 2010.
@inproceedings{4521878f0a0f474c8bc6929263c0a031,
title = "CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model",
abstract = "We study the problem of distributed scheduling in multi-hop MIMO networks. We first develop a {"}MIMO-pipe{"} model that provides the upper layers a set of rates and SINR requirements, which capture the rate-reliability tradeoff in MIMO communications. The main thrust of this study is then dedicated to developing CSMA-based MIMO-pipe scheduling under the SINR model. We choose the SINR model over the extensively studied matching or 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 makes the problem of devising distributed scheduling algorithms particularly challenging. To that end, we explore CSMA-based MIMO-pipe scheduling, from two perspectives. First, we consider an idealized continuous time CSMA network. We propose a dual-band approach in which control messages are exchanged instantaneously over a channel separate from the data channel, and show that CSMA-based scheduling can achieve throughput optimality under the SINR model. Next, we consider a discrete time CSMA network. To tackle the challenge due to the coupling caused by interference, we propose a {"}conservative{"} scheduling algorithm in which more stringent SINR constraints are imposed based on the MIMO-pipe model. We show that this suboptimal distributed scheduling can achieve an efficiency ratio bounded from below.",
author = "Dajun Qian and Dong Zheng and Junshan Zhang and Ness Shroff",
year = "2010",
doi = "10.1109/INFCOM.2010.5462119",
language = "English (US)",
isbn = "9781424458363",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model

AU - Qian, Dajun

AU - Zheng, Dong

AU - Zhang, Junshan

AU - Shroff, Ness

PY - 2010

Y1 - 2010

N2 - We study the problem of distributed scheduling in multi-hop MIMO networks. We first develop a "MIMO-pipe" model that provides the upper layers a set of rates and SINR requirements, which capture the rate-reliability tradeoff in MIMO communications. The main thrust of this study is then dedicated to developing CSMA-based MIMO-pipe scheduling under the SINR model. We choose the SINR model over the extensively studied matching or 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 makes the problem of devising distributed scheduling algorithms particularly challenging. To that end, we explore CSMA-based MIMO-pipe scheduling, from two perspectives. First, we consider an idealized continuous time CSMA network. We propose a dual-band approach in which control messages are exchanged instantaneously over a channel separate from the data channel, and show that CSMA-based scheduling can achieve throughput optimality under the SINR model. Next, we consider a discrete time CSMA network. To tackle the challenge due to the coupling caused by interference, we propose a "conservative" scheduling algorithm in which more stringent SINR constraints are imposed based on the MIMO-pipe model. We show that this suboptimal distributed scheduling can achieve an efficiency ratio bounded from below.

AB - We study the problem of distributed scheduling in multi-hop MIMO networks. We first develop a "MIMO-pipe" model that provides the upper layers a set of rates and SINR requirements, which capture the rate-reliability tradeoff in MIMO communications. The main thrust of this study is then dedicated to developing CSMA-based MIMO-pipe scheduling under the SINR model. We choose the SINR model over the extensively studied matching or 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 makes the problem of devising distributed scheduling algorithms particularly challenging. To that end, we explore CSMA-based MIMO-pipe scheduling, from two perspectives. First, we consider an idealized continuous time CSMA network. We propose a dual-band approach in which control messages are exchanged instantaneously over a channel separate from the data channel, and show that CSMA-based scheduling can achieve throughput optimality under the SINR model. Next, we consider a discrete time CSMA network. To tackle the challenge due to the coupling caused by interference, we propose a "conservative" scheduling algorithm in which more stringent SINR constraints are imposed based on the MIMO-pipe model. We show that this suboptimal distributed scheduling can achieve an efficiency ratio bounded from below.

UR - http://www.scopus.com/inward/record.url?scp=77953308693&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953308693&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2010.5462119

DO - 10.1109/INFCOM.2010.5462119

M3 - Conference contribution

SN - 9781424458363

BT - Proceedings - IEEE INFOCOM

ER -