Approaching Optimal Centralized Scheduling with CSMA- based Random Access over Fading Channels
(2016) In IEEE Communications Letters 20(6). p.1183-1186- Abstract
- 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... (More) - 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 (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1366c020-00e1-4cf3-9196-fec414c2b6c7
- author
- Karaca, Mehmet LU and Landfeldt, Björn LU
- organization
- publishing date
- 2016
- type
- Contribution to journal
- publication status
- published
- subject
- in
- IEEE Communications Letters
- volume
- 20
- issue
- 6
- pages
- 4 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- scopus:84976501390
- wos:000383741400032
- ISSN
- 1089-7798
- DOI
- 10.1109/LCOMM.2016.2547951
- project
- ELLIIT LU P01: WP2 Networking solutions
- language
- English
- LU publication?
- yes
- id
- 1366c020-00e1-4cf3-9196-fec414c2b6c7
- date added to LUP
- 2016-04-12 09:18:10
- date last changed
- 2022-02-21 17:27:42
@article{1366c020-00e1-4cf3-9196-fec414c2b6c7, abstract = {{Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain the largest capacity region as<br/>the centralized Max-Weight policy does. Despite their capability<br/>of achieving throughput-optimality, these algorithms can either<br/>incur large delay and have large complexity or only operate<br/>over non-fading channels. In this letter, by assuming arbitrary<br/>back-off time we first propose a fully distributed randomized<br/>algorithm whose performance can be pushed to the performance<br/>of the centralized Max-Weight policy not only in terms of<br/>throughput but also in terms of delay for completely-connected<br/>interference networks with fading channels. Then, inspired by the<br/>proposed algorithm we introduce an implementable distributed<br/>algorithm for practical networks with a reservation scheme. We<br/>show that the proposed practical algorithm can still achieve the<br/>performance of the centralized Max-Weight policy}}, author = {{Karaca, Mehmet and Landfeldt, Björn}}, issn = {{1089-7798}}, language = {{eng}}, number = {{6}}, pages = {{1183--1186}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, series = {{IEEE Communications Letters}}, title = {{Approaching Optimal Centralized Scheduling with CSMA- based Random Access over Fading Channels}}, url = {{http://dx.doi.org/10.1109/LCOMM.2016.2547951}}, doi = {{10.1109/LCOMM.2016.2547951}}, volume = {{20}}, year = {{2016}}, }