There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 759 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 746 | - |
dc.citation.title | IEEE-ACM TRANSACTIONS ON NETWORKING | - |
dc.citation.volume | 21 | - |
dc.contributor.author | Qian, Dajun | - |
dc.contributor.author | Zheng, Dong | - |
dc.contributor.author | Zhang, Junshan | - |
dc.contributor.author | Shroff, Ness B. | - |
dc.contributor.author | Joo, Changhee | - |
dc.date.accessioned | 2023-12-22T03:46:04Z | - |
dc.date.available | 2023-12-22T03:46:04Z | - |
dc.date.created | 2013-08-26 | - |
dc.date.issued | 2013-06 | - |
dc.description.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. | - |
dc.identifier.bibliographicCitation | IEEE-ACM TRANSACTIONS ON NETWORKING, v.21, no.3, pp.746 - 759 | - |
dc.identifier.doi | 10.1109/TNET.2012.2208200 | - |
dc.identifier.issn | 1063-6692 | - |
dc.identifier.scopusid | 2-s2.0-84879191214 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/4142 | - |
dc.identifier.url | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84879191214 | - |
dc.identifier.wosid | 000320605900006 | - |
dc.language | 영어 | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Distributed CSMA Algorithms for Link Scheduling in Multihop MIMO Networks Under SINR Model | - |
dc.type | Article | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Telecommunications | - |
dc.relation.journalResearchArea | Computer Science; Engineering; Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Carrier sense multiple access (CSMA) | - |
dc.subject.keywordAuthor | multihop networks | - |
dc.subject.keywordAuthor | multiple-input-multiple-output (MIMO) | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | signal-to-interference-plus-noise ratio (SINR) interference model | - |
dc.subject.keywordPlus | CAPACITY | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.