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

Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks

Author(s)
Joo, ChangheeShroff, Ness B.
Issued Date
2009-10
DOI
10.1109/TNET.2008.2010857
URI
https://scholarworks.unist.ac.kr/handle/201301/9829
Fulltext
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=70350558445
Citation
IEEE-ACM TRANSACTIONS ON NETWORKING, v.17, no.5, pp.1481 - 1493
Abstract
The scheduling problem in multi-hop wireless networks has been extensively investigated. Although throughput optimal scheduling solutions have been developed in the literature, they are unsuitable for multi-hop wireless systems because they are usually centralized and have very high complexity. In this paper, we develop a random-access based scheduling scheme that utilizes local information. The important features of this scheme include constant-time complexity, distributed operations, and a provable performance guarantee. Analytical results show that it guarantees a larger fraction of the optimal throughput performance than the state-of-the-art. Through simulations with both single-hop and multi-hop traffics, we observe that the scheme provides high throughput, close to that of a well-known highly efficient centralized greedy solution called the Greedy Maximal Scheduler.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
ISSN
1063-6692

qrcode

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