Simple, optimal, and robust random access

A. Hamed Mohsenian-Rad, Jianwei Huang, Mung Chiang, Vincent W.S. Wong

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

Abstract

In this paper, we propose two distributed contention-based medium access control (MAC) algorithms to solve a network utility maximization (NUM) problem in wireless ad hoc networks. Most of the previous NUM-based random access algorithms have one or more of the following performance bottlenecks: (1) extensive signaling among nodes, (2) synchronous updates of contention probabilities, (3) small update stepsizes to ensure convergence but with typically slow speed, and (4) supporting a limited range of utility functions under which the NUM is shown to be convex. Our algorithms overcome these bottlenecks in all four aspects. First, only limited message passing among nodes is required. Second, fully asynchronous updates of contention probabilities are allowed. Furthermore, our algorithms are robust to arbitrary large message passing delays and message loss. Third, we do not utilize any stepsize during updates, thus our algorithms can achieve faster convergence. Finally, our algorithms have provable convergence, optimality, and robustness properties under a wider range of utility functions, even if the NUM problem is non-convex.

Original languageEnglish (US)
Title of host publication2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success
DOIs
StatePublished - Dec 1 2008
Event2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success - Washington, DC, United States
Duration: Nov 17 2008Nov 19 2008

Publication series

NameProceedings - IEEE Military Communications Conference MILCOM

Other

Other2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success
CountryUnited States
CityWashington, DC
Period11/17/0811/19/08

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Simple, optimal, and robust random access'. Together they form a unique fingerprint.

  • Cite this

    Mohsenian-Rad, A. H., Huang, J., Chiang, M., & Wong, V. W. S. (2008). Simple, optimal, and robust random access. In 2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success [4753315] (Proceedings - IEEE Military Communications Conference MILCOM). https://doi.org/10.1109/MILCOM.2008.4753315