Controlled random access MAC for network utility maximization in wireless networks

Robert J. McCabe, Nikolaos Freris, P. R. Kumar

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

Abstract

There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the observation that a decomposition of the Lagrangian suggests an approach where transmissions are scheduled to minimize backpressure. However, a satisfactory Medium Access Control (MAC) protocol that can realize such a scheduling algorithm is notably missing, and that is the goal of this paper. We present a candidate random access MAC protocol that extends an existing algorithm to calculate the access probabilities. We also consider the online adaptation of access probabilities using local information about queue lengths and active links. In addition, we also modify the backpressure algorithm itself, by incorporating a minimum hop bias to alleviate the inherent problem of routing loops. We have implemented a general purpose simulation framework to study the comparative performance of network management protocols for congestion control, routing, MAC, and their cross-layer interaction. Using this, we compare the performance of our scheme with the leading schemes.

Original languageEnglish (US)
Title of host publicationProceedings of the 47th IEEE Conference on Decision and Control, CDC 2008
Pages2350-2355
Number of pages6
DOIs
StatePublished - Dec 1 2008
Event47th IEEE Conference on Decision and Control, CDC 2008 - Cancun, Mexico
Duration: Dec 9 2008Dec 11 2008

Other

Other47th IEEE Conference on Decision and Control, CDC 2008
CountryMexico
CityCancun
Period12/9/0812/11/08

Fingerprint

Utility Maximization
Medium Access Control
Random Access
Medium access control
Wireless Networks
Wireless networks
Network protocols
Routing
Congestion control (communication)
Cross-layer
Congestion Control
Simulation Framework
Network Management
Queue Length
Network management
Scheduling algorithms
Utility Function
Scheduling Algorithm
Decomposition
Minimise

ASJC Scopus subject areas

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

Cite this

McCabe, R. J., Freris, N., & Kumar, P. R. (2008). Controlled random access MAC for network utility maximization in wireless networks. In Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008 (pp. 2350-2355). [4738666] https://doi.org/10.1109/CDC.2008.4738666

Controlled random access MAC for network utility maximization in wireless networks. / McCabe, Robert J.; Freris, Nikolaos; Kumar, P. R.

Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008. 2008. p. 2350-2355 4738666.

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

McCabe, RJ, Freris, N & Kumar, PR 2008, Controlled random access MAC for network utility maximization in wireless networks. in Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008., 4738666, pp. 2350-2355, 47th IEEE Conference on Decision and Control, CDC 2008, Cancun, Mexico, 12/9/08. https://doi.org/10.1109/CDC.2008.4738666
McCabe RJ, Freris N, Kumar PR. Controlled random access MAC for network utility maximization in wireless networks. In Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008. 2008. p. 2350-2355. 4738666 https://doi.org/10.1109/CDC.2008.4738666
McCabe, Robert J. ; Freris, Nikolaos ; Kumar, P. R. / Controlled random access MAC for network utility maximization in wireless networks. Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008. 2008. pp. 2350-2355
@inproceedings{1ebaedd6d4c3430e86b38899995797c2,
title = "Controlled random access MAC for network utility maximization in wireless networks",
abstract = "There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the observation that a decomposition of the Lagrangian suggests an approach where transmissions are scheduled to minimize backpressure. However, a satisfactory Medium Access Control (MAC) protocol that can realize such a scheduling algorithm is notably missing, and that is the goal of this paper. We present a candidate random access MAC protocol that extends an existing algorithm to calculate the access probabilities. We also consider the online adaptation of access probabilities using local information about queue lengths and active links. In addition, we also modify the backpressure algorithm itself, by incorporating a minimum hop bias to alleviate the inherent problem of routing loops. We have implemented a general purpose simulation framework to study the comparative performance of network management protocols for congestion control, routing, MAC, and their cross-layer interaction. Using this, we compare the performance of our scheme with the leading schemes.",
author = "McCabe, {Robert J.} and Nikolaos Freris and Kumar, {P. R.}",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/CDC.2008.4738666",
language = "English (US)",
isbn = "9781424431243",
pages = "2350--2355",
booktitle = "Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008",

}

TY - GEN

T1 - Controlled random access MAC for network utility maximization in wireless networks

AU - McCabe, Robert J.

AU - Freris, Nikolaos

AU - Kumar, P. R.

PY - 2008/12/1

Y1 - 2008/12/1

N2 - There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the observation that a decomposition of the Lagrangian suggests an approach where transmissions are scheduled to minimize backpressure. However, a satisfactory Medium Access Control (MAC) protocol that can realize such a scheduling algorithm is notably missing, and that is the goal of this paper. We present a candidate random access MAC protocol that extends an existing algorithm to calculate the access probabilities. We also consider the online adaptation of access probabilities using local information about queue lengths and active links. In addition, we also modify the backpressure algorithm itself, by incorporating a minimum hop bias to alleviate the inherent problem of routing loops. We have implemented a general purpose simulation framework to study the comparative performance of network management protocols for congestion control, routing, MAC, and their cross-layer interaction. Using this, we compare the performance of our scheme with the leading schemes.

AB - There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the observation that a decomposition of the Lagrangian suggests an approach where transmissions are scheduled to minimize backpressure. However, a satisfactory Medium Access Control (MAC) protocol that can realize such a scheduling algorithm is notably missing, and that is the goal of this paper. We present a candidate random access MAC protocol that extends an existing algorithm to calculate the access probabilities. We also consider the online adaptation of access probabilities using local information about queue lengths and active links. In addition, we also modify the backpressure algorithm itself, by incorporating a minimum hop bias to alleviate the inherent problem of routing loops. We have implemented a general purpose simulation framework to study the comparative performance of network management protocols for congestion control, routing, MAC, and their cross-layer interaction. Using this, we compare the performance of our scheme with the leading schemes.

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

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

U2 - 10.1109/CDC.2008.4738666

DO - 10.1109/CDC.2008.4738666

M3 - Conference contribution

AN - SCOPUS:62949134606

SN - 9781424431243

SP - 2350

EP - 2355

BT - Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008

ER -