Approaching Optimal Centralized Scheduling with CSMA-Based Random Access over Fading Channels

Creative Commons License

Karaca M., Landfeldt B.

IEEE Communications Letters, cilt.20, sa.6, ss.1183-1186, 2016 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 20 Sayı: 6
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1109/lcomm.2016.2547951
  • Dergi Adı: IEEE Communications Letters
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1183-1186
  • Anahtar Kelimeler: Max-Weight scheduling, CSMA, queue stability, distributed algorithm, fading channels
  • TED Üniversitesi Adresli: Hayır

Özet

© 1997-2012 IEEE.Carrier sense multiple access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput optimality, these algorithms can either incur large delay and have large complexity or only operate over nonfading channels. In this letter, by assuming arbitrary backoff time, we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely connected interference networks with fading channels. Then, inspired by the proposed algorithm, we introduce an implementable distributed algorithm for practical networks with a reservation scheme. We show that the proposed practical algorithm can still achieve the performance of the centralized Max-Weight policy.