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

Summary, in English

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 non-fading channels. In this letter, by assuming arbitrary
back-off 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

• Författare: Mehmet Karaca; Björn Landfeldt
• Avdelning/ar: Institutionen för elektro- och informationsteknik; MAPCI - Mobile and Pervasive Computing Institute at Lund University; ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publiceringsår: 2016
• Språk: Engelska
• Sidor: 1183-1186
• Publikation/Tidskrift/Serie: IEEE Communications Letters
• Volym: 20
• Issue: 6
• Länkar: http://dx.doi.org/10.1109/LCOMM.2016.2547951
• Dokumenttyp: Artikel i tidskrift
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Communication Systems
• Status: Published
• Projekt: ELLIIT LU P01: WP2 Networking solutions
• ISBN/ISSN/Övrigt: ISSN: 1089-7798