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

Dajun Qian, Dong Zheng, Junshan Zhang, Ness B. Shroff, Changhee Joo

Research output: Contribution to journalArticle

25 Citations (Scopus)

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.

Original languageEnglish (US)
Article number6256765
Pages (from-to)746-759
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume21
Issue number3
DOIs
StatePublished - 2013

Fingerprint

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

Keywords

  • Carrier sense multiple access (CSMA)
  • multihop networks
  • multiple-input-multiple-output (MIMO)
  • scheduling
  • signal-to-interference-plus-noise ratio (SINR) interference model

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Distributed CSMA algorithms for link scheduling in multihop MIMO networks under sinr model. / Qian, Dajun; Zheng, Dong; Zhang, Junshan; Shroff, Ness B.; Joo, Changhee.

In: IEEE/ACM Transactions on Networking, Vol. 21, No. 3, 6256765, 2013, p. 746-759.

Research output: Contribution to journalArticle

Qian, Dajun ; Zheng, Dong ; Zhang, Junshan ; Shroff, Ness B. ; Joo, Changhee. / Distributed CSMA algorithms for link scheduling in multihop MIMO networks under sinr model. In: IEEE/ACM Transactions on Networking. 2013 ; Vol. 21, No. 3. pp. 746-759.
@article{efd0ecd3e9b1493298c668bb01586a0d,
title = "Distributed CSMA algorithms for link scheduling in multihop MIMO networks under sinr model",
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.",
keywords = "Carrier sense multiple access (CSMA), multihop networks, multiple-input-multiple-output (MIMO), scheduling, signal-to-interference-plus-noise ratio (SINR) interference model",
author = "Dajun Qian and Dong Zheng and Junshan Zhang and Shroff, {Ness B.} and Changhee Joo",
year = "2013",
doi = "10.1109/TNET.2012.2208200",
language = "English (US)",
volume = "21",
pages = "746--759",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Distributed CSMA algorithms for link scheduling in multihop MIMO networks under sinr model

AU - Qian, Dajun

AU - Zheng, Dong

AU - Zhang, Junshan

AU - Shroff, Ness B.

AU - Joo, Changhee

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Carrier sense multiple access (CSMA)

KW - multihop networks

KW - multiple-input-multiple-output (MIMO)

KW - scheduling

KW - signal-to-interference-plus-noise ratio (SINR) interference model

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

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

U2 - 10.1109/TNET.2012.2208200

DO - 10.1109/TNET.2012.2208200

M3 - Article

AN - SCOPUS:84879191214

VL - 21

SP - 746

EP - 759

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 3

M1 - 6256765

ER -