Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 2008 | Published
Journal Article Open

A Game-Theoretic Framework for Medium Access Control

Abstract

In this paper, we generalize the random access game model, and show that it provides a general game-theoretic framework for designing contention based medium access control. We extend the random access game model to the network with multiple contention measure signals, study the design of random access games, and analyze different distributed algorithms achieving their equilibria. As examples, a series of utility functions is proposed for games achieving the maximum throughput in a network of homogeneous nodes. In a network with n traffic classes, an N-signal game model is proposed which achieves the maximum throughput under the fairness constraint among different traffic classes. In addition, the convergence of different dynamic algorithms such as best response, gradient play and Jacobi play under propagation delay and estimation error is established. Simulation results show that game model based protocols can achieve superior performance over the standard IEEE 802.11 DCF, and comparable performance as existing protocols with the best performance in literature.

Additional Information

© Copyright 2008 IEEE. Reprinted with permission. Manuscript received August 15, 2007; revised March 10, 2008. [Date Published in Issue: 2008-08-22] This work has been supported in part by NSF grants CNS-0435520 and CNS-0520349, and Caltech's Lee Center for Advanced Networking. This paper has been presented in part at the International Wireless Internet Conference, October 2007, Austin, Texas, USA.

Attached Files

Published - CUIieeejsac08.pdf

Files

CUIieeejsac08.pdf
Files (784.9 kB)
Name Size Download all
md5:81853fb85ec669d2ef361bec57123a46
784.9 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 17, 2023