Jointly optimal congestion and contention control based on network utility maximization

Jang Won Lee, Mung Chiang, A. Robert Calderbank

Research output: Contribution to journalArticle

106 Citations (Scopus)

Abstract

We study joint end-to-end congestion control and per-link medium access control (MAC) in ad-hoc networks. We use a network utility maximization formulation, in which by adjusting the types of utility functions, we can accommodate multi-class services as well as exploit the tradeoff between efficiency and fairness of resource allocation. Despite the inherent difficulties of non-convexity and non-separability of the optimization problem, we show that, with readily-verifiable sufficient conditions, we can develop a distributed algorithm that converges to the globally and jointly optimal rate allocation and persistence probabilities.

Original languageEnglish
Pages (from-to)216-218
Number of pages3
JournalIEEE Communications Letters
Volume10
Issue number3
DOIs
Publication statusPublished - 2006 Mar 1

Fingerprint

Non-convexity
Utility Maximization
Optimal Rates
Medium Access Control
Congestion Control
Multi-class
Contention
Distributed Algorithms
Ad Hoc Networks
Fairness
Utility Function
Congestion
Resource Allocation
Persistence
Trade-offs
Optimization Problem
Converge
Formulation
Sufficient Conditions
Medium access control

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Lee, Jang Won ; Chiang, Mung ; Calderbank, A. Robert. / Jointly optimal congestion and contention control based on network utility maximization. In: IEEE Communications Letters. 2006 ; Vol. 10, No. 3. pp. 216-218.
@article{d936d4e49033400d9be2c15dab8e3b6e,
title = "Jointly optimal congestion and contention control based on network utility maximization",
abstract = "We study joint end-to-end congestion control and per-link medium access control (MAC) in ad-hoc networks. We use a network utility maximization formulation, in which by adjusting the types of utility functions, we can accommodate multi-class services as well as exploit the tradeoff between efficiency and fairness of resource allocation. Despite the inherent difficulties of non-convexity and non-separability of the optimization problem, we show that, with readily-verifiable sufficient conditions, we can develop a distributed algorithm that converges to the globally and jointly optimal rate allocation and persistence probabilities.",
author = "Lee, {Jang Won} and Mung Chiang and Calderbank, {A. Robert}",
year = "2006",
month = "3",
day = "1",
doi = "10.1109/LCOMM.2006.1603389",
language = "English",
volume = "10",
pages = "216--218",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

Jointly optimal congestion and contention control based on network utility maximization. / Lee, Jang Won; Chiang, Mung; Calderbank, A. Robert.

In: IEEE Communications Letters, Vol. 10, No. 3, 01.03.2006, p. 216-218.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Jointly optimal congestion and contention control based on network utility maximization

AU - Lee, Jang Won

AU - Chiang, Mung

AU - Calderbank, A. Robert

PY - 2006/3/1

Y1 - 2006/3/1

N2 - We study joint end-to-end congestion control and per-link medium access control (MAC) in ad-hoc networks. We use a network utility maximization formulation, in which by adjusting the types of utility functions, we can accommodate multi-class services as well as exploit the tradeoff between efficiency and fairness of resource allocation. Despite the inherent difficulties of non-convexity and non-separability of the optimization problem, we show that, with readily-verifiable sufficient conditions, we can develop a distributed algorithm that converges to the globally and jointly optimal rate allocation and persistence probabilities.

AB - We study joint end-to-end congestion control and per-link medium access control (MAC) in ad-hoc networks. We use a network utility maximization formulation, in which by adjusting the types of utility functions, we can accommodate multi-class services as well as exploit the tradeoff between efficiency and fairness of resource allocation. Despite the inherent difficulties of non-convexity and non-separability of the optimization problem, we show that, with readily-verifiable sufficient conditions, we can develop a distributed algorithm that converges to the globally and jointly optimal rate allocation and persistence probabilities.

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

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

U2 - 10.1109/LCOMM.2006.1603389

DO - 10.1109/LCOMM.2006.1603389

M3 - Article

AN - SCOPUS:33644920362

VL - 10

SP - 216

EP - 218

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 3

ER -