File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

DSS: Distributed SINR-based scheduling algorithm for multihop wireless networks

Author(s)
Ryu, JihoJoo, ChangheeKwon, Ted TaekyoungShroff, Ness B.Choi, Yanghee
Issued Date
2013-06
DOI
10.1109/TMC.2012.81
URI
https://scholarworks.unist.ac.kr/handle/201301/3270
Fulltext
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84876992877
Citation
IEEE TRANSACTIONS ON MOBILE COMPUTING, v.12, no.6, pp.1120 - 1132
Abstract
The problem of developing distributed scheduling algorithms for high throughput in multihop wireless networks has been extensively studied in recent years. The design of a distributed low-complexity scheduling algorithm becomes even more challenging when taking into account a physical interference model, which requires the SINR at a receiver to be checked when making scheduling decisions. To do so, we need to check whether a transmission failure is caused by interference due to simultaneous transmissions from distant nodes. In this paper, we propose a scheduling algorithm under a physical interference model, which is amenable to distributed implementation with 802.11 CSMA technologies. The proposed scheduling algorithm is shown to achieve throughput optimality. We present two variations of the algorithm to enhance the delay performance and to reduce the control overhead, respectively, while retaining throughput optimality.
Publisher
IEEE COMPUTER SOC
ISSN
1536-1233
Keyword (Author)
Wireless schedulingSINRCSMAdiscrete time Markov chain
Keyword
STABILITYPOLICIES

qrcode

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