BROWSE

Related Researcher

Author

Joo, Changhee
Learning, Modeling, and Networking
Research Interests
  • Learning, modeling, networking, resource allocation, stochastic optimization, distributed computing, low complexity

ITEM VIEW & DOWNLOAD

Distributed CSMA Algorithms for Link Scheduling in Multihop MIMO Networks Under SINR Model

Cited 0 times inthomson ciCited 1 times inthomson ci
Title
Distributed CSMA Algorithms for Link Scheduling in Multihop MIMO Networks Under SINR Model
Author
Qian, DajunZheng, DongZhang, JunshanShroff, Ness B.Joo, Changhee
Keywords
Carrier sense multiple access (CSMA); Distributed scheduling; Distributed scheduling algorithms; Interference models; Link scheduling algorithms; Multihop networks; Signal to interferences; Throughput Optimality
Issue Date
201306
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation
IEEE-ACM TRANSACTIONS ON NETWORKING, v.21, no.3, pp.746 - 759
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.
URI
Go to Link
DOI
http://dx.doi.org/10.1109/TNET.2012.2208200
ISSN
1063-6692
Appears in Collections:
ECE_Journal Papers

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show full item record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU