Utility-optimal random-access control

Journal Article (Journal Article)

This paper designs medium access control (MAC) protocols for wireless networks through the network utility maximization (NUM) framework. A network-wide utility maximization problem is formulated, using a collision/persistenceprobabilistic model and aligning selfish utility with total social welfare. By adjusting the parameters in the utility objective functions of the NUM problem, we can also control the tradeoff between efficiency and fairness of radio resource allocation. We develop two distributed algorithms to solve the utility-optimal random-access control problem, which lead to random access protocols that have slightly more message passing overhead than the current exponential-backoff protocols, but significant potential for efficiency and fairness improvement. We provide readily-verifiable sufficient conditions under which convergence of the proposed algorithms to a global optimality of network utility can be guaranteed, and numerical experiments that illustrate the value of the NUM approach to the complexity-performance tradeoff in MAC design. © 2007 IEEE.

Full Text

Duke Authors

Cited Authors

  • Lee, JW; Chiang, M; Calderbank, AR

Published Date

  • July 1, 2007

Published In

Volume / Issue

  • 6 / 7

Start / End Page

  • 2741 - 2750

International Standard Serial Number (ISSN)

  • 1536-1276

Digital Object Identifier (DOI)

  • 10.1109/TWC.2007.05991

Citation Source

  • Scopus