Performance bounds for CSMA-based medium access control

Nikolaos Freris

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In recent work, it was shown that the class of distributed random access MAC schemes leveraging Carrier-Sense Multiple Access (CSMA) is throughput-optimal. To fully assess the potential of such schemes, it is challenging to study their performance in terms of mean delays and compare it against that of centralized scheduling. In this paper, we present upper and lower bounds on the performance of CSMA-based random access MAC. We modify the ideal CSMA model to obtain one that further incorporates queue length information and admits a product-form stationary distribution. We analytically calculate its mean delay at the steady-state, and show that it yields an upper bound on the delay of ideal CSMA. We also derive a lower bound which is independent of the scheduling algorithm. The derived bounds coincide with the best known bounds for the popular max-weight scheduling, whence the performance of such distributed low-complexity schemes lies in the same regime as that of the centralized, generally NP-hard max-weight scheduling. Our results extend to slotted systems, as well as to a wide range of arrival-service processes. Finally, we develop a method for deriving upper and lower bounds on the performance of MAC algorithms by use of Linear Programming (LP) and present comparative simulation results.

Original languageEnglish (US)
Title of host publication2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
Pages5945-5950
Number of pages6
DOIs
StatePublished - Dec 1 2011
Event2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 - Orlando, FL, United States
Duration: Dec 12 2011Dec 15 2011

Other

Other2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
CountryUnited States
CityOrlando, FL
Period12/12/1112/15/11

Fingerprint

Carrier sense multiple access
Performance Bounds
Medium Access Control
Medium access control
Multiple Access
Random Access
Scheduling
Upper and Lower Bounds
Product Form
Queue Length
Stationary Distribution
Scheduling algorithms
Scheduling Algorithm
Linear programming
Low Complexity
Throughput
NP-complete problem
Lower bound
Upper bound
Calculate

Keywords

  • Carrier-Sense Multiple Access (CSMA)
  • Distributed algorithms
  • Medium Access Control (MAC)
  • Random-access MAC
  • Resource allocation
  • Wireless Networks

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Freris, N. (2011). Performance bounds for CSMA-based medium access control. In 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 (pp. 5945-5950). [6160300] https://doi.org/10.1109/CDC.2011.6160300

Performance bounds for CSMA-based medium access control. / Freris, Nikolaos.

2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011. 2011. p. 5945-5950 6160300.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Freris, N 2011, Performance bounds for CSMA-based medium access control. in 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011., 6160300, pp. 5945-5950, 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011, Orlando, FL, United States, 12/12/11. https://doi.org/10.1109/CDC.2011.6160300
Freris N. Performance bounds for CSMA-based medium access control. In 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011. 2011. p. 5945-5950. 6160300 https://doi.org/10.1109/CDC.2011.6160300
Freris, Nikolaos. / Performance bounds for CSMA-based medium access control. 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011. 2011. pp. 5945-5950
@inproceedings{7fa853ce90ce42578eda255e04352b7f,
title = "Performance bounds for CSMA-based medium access control",
abstract = "In recent work, it was shown that the class of distributed random access MAC schemes leveraging Carrier-Sense Multiple Access (CSMA) is throughput-optimal. To fully assess the potential of such schemes, it is challenging to study their performance in terms of mean delays and compare it against that of centralized scheduling. In this paper, we present upper and lower bounds on the performance of CSMA-based random access MAC. We modify the ideal CSMA model to obtain one that further incorporates queue length information and admits a product-form stationary distribution. We analytically calculate its mean delay at the steady-state, and show that it yields an upper bound on the delay of ideal CSMA. We also derive a lower bound which is independent of the scheduling algorithm. The derived bounds coincide with the best known bounds for the popular max-weight scheduling, whence the performance of such distributed low-complexity schemes lies in the same regime as that of the centralized, generally NP-hard max-weight scheduling. Our results extend to slotted systems, as well as to a wide range of arrival-service processes. Finally, we develop a method for deriving upper and lower bounds on the performance of MAC algorithms by use of Linear Programming (LP) and present comparative simulation results.",
keywords = "Carrier-Sense Multiple Access (CSMA), Distributed algorithms, Medium Access Control (MAC), Random-access MAC, Resource allocation, Wireless Networks",
author = "Nikolaos Freris",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/CDC.2011.6160300",
language = "English (US)",
isbn = "9781612848006",
pages = "5945--5950",
booktitle = "2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011",

}

TY - GEN

T1 - Performance bounds for CSMA-based medium access control

AU - Freris, Nikolaos

PY - 2011/12/1

Y1 - 2011/12/1

N2 - In recent work, it was shown that the class of distributed random access MAC schemes leveraging Carrier-Sense Multiple Access (CSMA) is throughput-optimal. To fully assess the potential of such schemes, it is challenging to study their performance in terms of mean delays and compare it against that of centralized scheduling. In this paper, we present upper and lower bounds on the performance of CSMA-based random access MAC. We modify the ideal CSMA model to obtain one that further incorporates queue length information and admits a product-form stationary distribution. We analytically calculate its mean delay at the steady-state, and show that it yields an upper bound on the delay of ideal CSMA. We also derive a lower bound which is independent of the scheduling algorithm. The derived bounds coincide with the best known bounds for the popular max-weight scheduling, whence the performance of such distributed low-complexity schemes lies in the same regime as that of the centralized, generally NP-hard max-weight scheduling. Our results extend to slotted systems, as well as to a wide range of arrival-service processes. Finally, we develop a method for deriving upper and lower bounds on the performance of MAC algorithms by use of Linear Programming (LP) and present comparative simulation results.

AB - In recent work, it was shown that the class of distributed random access MAC schemes leveraging Carrier-Sense Multiple Access (CSMA) is throughput-optimal. To fully assess the potential of such schemes, it is challenging to study their performance in terms of mean delays and compare it against that of centralized scheduling. In this paper, we present upper and lower bounds on the performance of CSMA-based random access MAC. We modify the ideal CSMA model to obtain one that further incorporates queue length information and admits a product-form stationary distribution. We analytically calculate its mean delay at the steady-state, and show that it yields an upper bound on the delay of ideal CSMA. We also derive a lower bound which is independent of the scheduling algorithm. The derived bounds coincide with the best known bounds for the popular max-weight scheduling, whence the performance of such distributed low-complexity schemes lies in the same regime as that of the centralized, generally NP-hard max-weight scheduling. Our results extend to slotted systems, as well as to a wide range of arrival-service processes. Finally, we develop a method for deriving upper and lower bounds on the performance of MAC algorithms by use of Linear Programming (LP) and present comparative simulation results.

KW - Carrier-Sense Multiple Access (CSMA)

KW - Distributed algorithms

KW - Medium Access Control (MAC)

KW - Random-access MAC

KW - Resource allocation

KW - Wireless Networks

UR - http://www.scopus.com/inward/record.url?scp=84860665972&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860665972&partnerID=8YFLogxK

U2 - 10.1109/CDC.2011.6160300

DO - 10.1109/CDC.2011.6160300

M3 - Conference contribution

AN - SCOPUS:84860665972

SN - 9781612848006

SP - 5945

EP - 5950

BT - 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011

ER -