Simple, optimal, and robust random access

TitleSimple, optimal, and robust random access
Publication TypeConference Paper
Year of Publication2008
AuthorsMohsenian-Rad, A. H., J. Huang, M. Chiang, and V. W. S. Wong
Conference NameMilitary Communications Conference, 2008. MILCOM 2008. IEEE
Pagination1 -7
Date Publishednov.
Keywordsaccess protocols, ad hoc networks, asynchronous updates, contention probabilities, distributed contention-based medium access control algorithms, extensive signaling, message passing delays, network utility maximization, probability, robust random access, synchronous updates, wireless ad hoc networks
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.

URLhttp://dx.doi.org/10.1109/MILCOM.2008.4753315
DOI10.1109/MILCOM.2008.4753315

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia